Path Planning Task
A Path Planning Task is a planning task that requires an agent path.
- Context:
- It can range from being a Complete-Information Path Planning Task to being an Incomplete-Information Path Planning Task.
- It can range from being a Virtual World Path Planning Task to being a Physical World Path Planning Task (such as robot motion planning).
- See: Mobile Robot, Autonomous Robot, CAD Software, Digital Character, Video Game, Robotic Surgery.
References
2017
- (Wikipedia, 2017) ⇒ https://en.wikipedia.org/wiki/Motion_planning Retrieved:2017-10-7.
- Motion planning (also known as the navigation problem or the piano mover's problem) is a term used in robotics for the process of breaking down a desired movement task into discrete motions that satisfy movement constraints and possibly optimize some aspect of the movement.
For example, consider navigating a mobile robot inside a building to a distant waypoint. It should execute this task while avoiding walls and not falling down stairs. A motion planning algorithm would take a description of these tasks as input, and produce the speed and turning commands sent to the robot's wheels. Motion planning algorithms might address robots with a larger number of joints (e.g., industrial manipulators), more complex tasks (e.g. manipulation of objects), different constraints (e.g., a car that can only drive forward), and uncertainty (e.g. imperfect models of the environment or robot).
Motion planning has several robotics applications, such as autonomy, automation, and robot design in CAD software, as well as applications in other fields, such as animating digital characters, video game artificial intelligence, architectural design, robotic surgery, and the study of biological molecules.
- Motion planning (also known as the navigation problem or the piano mover's problem) is a term used in robotics for the process of breaking down a desired movement task into discrete motions that satisfy movement constraints and possibly optimize some aspect of the movement.