Motion Planning With Obstacles And Dynamic Constraints PDF Download

The main charter of this contract is the implementation and experimentation with motion planning algorithms that emphasize the exact combinatorial and purely geometric approach. Motion planning is considered to be one of the major research areas in robotics, and is one of the main stages in the design and implementation of autonomous intelligent systems, which is an important long-range goal in robotics research. Motion planning is one of the basic capabilities that such a system must possess. In purely geometric terms, the simplest version of the problem can be stated as follows. The system is given complete information about the geometry of the environment in which it is to operate (and of its own structure), and has to process it so that, when commanded to move from its current position to some target position, it can determine whether it can do so without colliding with any of the obstacles around it, and if so plan (and execute) such a motion. These are many variants of the problem. A few of those are: motion planning in environments that are only partially known to the system, compliant motion planning that allows contact with obstacles, which might be unavoidable due to measurement errors, optimal motion planning, motion planning with kino-dynamic constraints, and motion planning amidst moving obstacles. Still, even the simplest, static, and purely geometric version stated above is far from being simple, and poses serious challenges in the design of efficient and robust algorithms.