Planar point location using persistent search trees
Communications of the ACM
Toward efficient trajectory planning: the path-velocity decomposition
International Journal of Robotics Research
Unobstructed shortest paths in polyhedral environments
Unobstructed shortest paths in polyhedral environments
Algorithms
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
SCG '85 Proceedings of the first annual symposium on Computational geometry
An algorithm for planning collision-free paths among polyhedral obstacles
Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
ACM SIGACT News
Gross motion planning—a survey
ACM Computing Surveys (CSUR)
Planning motions with intentions
SIGGRAPH '94 Proceedings of the 21st annual conference on Computer graphics and interactive techniques
Learning state features from policies to bias exploration in reinforcement learning
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Collision Detection of a Moving Polygon in the Presence of Polygonal Obstacles in the Plane
IEEE Transactions on Pattern Analysis and Machine Intelligence
Movement Planning in the Presence of Flows
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Relevance Cuts: Localizing the Search
CG '98 Proceedings of the First International Conference on Computers and Games
Reinforcement learning based on local state feature learning and policy adjustment
Information Sciences—Informatics and Computer Science: An International Journal - Special issue: Introduction to multimedia and mobile agents
A Hybrid Approach to Intricate Motion, Manipulation and Task Planning
International Journal of Robotics Research
'Teleportation': based motion planner for design error analysis
ICRA'09 Proceedings of the 2009 IEEE international conference on Robotics and Automation
Regrasp planning for pivoting manipulation by a humanoid robot
ICRA'09 Proceedings of the 2009 IEEE international conference on Robotics and Automation
A decision-theoretic formalism for belief-optimal reasoning
PerMIS '09 Proceedings of the 9th Workshop on Performance Metrics for Intelligent Systems
A predictive evolutionary algorithm for dynamic constrained inverse kinematics problems
HAIS'12 Proceedings of the 7th international conference on Hybrid Artificial Intelligent Systems - Volume Part I
Autonomous Robots
Non-linear dynamical system approach to behavior modeling
The Visual Computer: International Journal of Computer Graphics
| Hi-index | 0.00 |
Motion planning algorithms have generally dealt with motion in a static environment, or more recently, with motion in an environment that changes in a known manner. We consider the problem of finding collision-free motions in a changeable environment. That is, we wish to find a motion for an object where the object is permitted to move some of the obstacles. In such an environment the final positions of the movable obstacles may or may not be part of the goal. In the case where the final positions of the obstacles are unspecified, the motion planning problem is shown to be NP-hard. An algorithm that runs in &Ogr;(n2logn) time after &Ogr;(n3log2n) preprocessing time is presented when the object to be moved is polygonal and there is only one movable polygonal obstacle in a polygonal environment of complexity &Ogr;(n). In the case where the final positions of the obstacles are specified the general problem is shown to be PSPACE-hard and an algorithm is given when there is one movable obstacle with the same preprocessing time as the previous algorithm but with &Ogr;(n2) query time.