Algorithmic and complexity issues of robot motion in an uncertain environment
Without doubt the path planning for autonomous vehicles or arm manipulators is one of the main problems in robotics. Usually two basic approaches are considered: path planning with complete information, in which full information is given on the geometry and positions of the robot and the obstacle and the other approach, called path planning with incomplete information, in which an element of uncertainty about the environment is contained. In the reviewed paper a new approach is presented, called dynamic path planning; it is based on the latter model and gives rise to algorithmic and computational issues very different from those by the former approach. This new approach provides provable (nonheuristic) path planning algorithms for a robot operating in a highly unstructured environment, where no knowledge about the obstacles is available beforehand and no constraints on the geometry of the obstacles are imposed. The paper consists of an introduction and four main parts. The introduction contains basic models of the path planning problem and discusses previous work in this domain. In the first part the problem of moving a point automaton in the plane is presented and, in the second part, the problem of moving a planar arm manipulator. In the third part, the problem for three-dimensional arm manipulators is sketched. The fourth part includes an experimental validation of the algorithms of dynamic path planning. An application of sensor devices for robot arms is also mentioned. Finally, the autor concludes that although the models are incompatible much would be gained if they could be combined.
- Dynamic path planning for a planar articulated robot arm moving amidst unknown obstacles
- Path-planning strategies for a point mobile automaton moving amidst unknown obstacles of arbitrary shape
- scientific article; zbMATH DE number 4174372
- scientific article; zbMATH DE number 4108220
- scientific article; zbMATH DE number 4089425
- Dynamic path planning for a mobile automaton with limited information on the environment
- Dynamic path planning for a planar articulated robot arm moving amidst unknown obstacles
- scientific article; zbMATH DE number 3827201 (Why is no real title available?)
- scientific article; zbMATH DE number 3939137 (Why is no real title available?)
- scientific article; zbMATH DE number 3305051 (Why is no real title available?)
- Obstacle avoidance by a robot manipulator under limited information about the environment
- On the Piano Movers problem. II: General techniques for computing topological properties of real algebraic manifolds
- On the Movement of Robot Arms in 2-Dimensional Bounded Regions
- On the “piano movers'” problem I. The case of a two-dimensional rigid polygonal body moving amidst polygonal barriers
- Path-planning strategies for a point mobile automaton moving amidst unknown obstacles of arbitrary shape
- Segments, rectangles, contours
- Some new algebraic methods in topology
- Dynamic path planning for a planar articulated robot arm moving amidst unknown obstacles
- Path-planning strategies for a point mobile automaton moving amidst unknown obstacles of arbitrary shape
- On-line motion planning: Case of a planar rod
- The auction technique for the sensor based navigation planning of an autonomous mobile robot
- Robot path planning in a dynamic environment with stochastic measurements
- A three dimensional path planning algorithm
- scientific article; zbMATH DE number 988315 (Why is no real title available?)
- scientific article; zbMATH DE number 4089425 (Why is no real title available?)
- scientific article; zbMATH DE number 1940375 (Why is no real title available?)
- Efficient strategies for robot navigation in unknown environment
- Dynamic path planning for a mobile automaton with limited information on the environment
- ON THE PATH PLANNING PROBLEM IN THE VICINITY OF OBSTACLES
- Planning high-level paths in hostile, dynamic, and uncertain environments
- A vectorization path planning in dynamic environment
- On One Approach to Robot Motion Planning
- Performance bounds for planning in unknown terrain
- Artificial coordinating field and its application to motion planning of robots in uncertain dynamic environments
- The complexity of planar compliant motion planning under uncertainty
This page was built for publication: Algorithmic and complexity issues of robot motion in an uncertain environment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1109740)