Task-Aware Waypoint Sampling for Robotic Planning
| Task and motion planning Robotics Waypoint sampling |
PaperID: 4
pdf
poster
|
| To achieve a complex task, a robot often needs to navigate in a physical space to complete activities in different locations. For example, it may need to inspect several structures, making multiple observations of each structure from different perspectives. Typically, the positions from which these activities can be performed are represented as waypoints – discrete positions that are sampled from the continuous physical space. Existing approaches to waypoint selection either iteratively consider the entire space or each activity separately, which can lead to task planning problems that are more complex than is necessary or to plans of compromised quality. We offer an approach that produces more efficient plans by performing a one-time computation of the connectivity graph and by prioritizing waypoints from which multiple activities can be performed. In addition, we support user specified performance preferences that represent preferences a system operator may have about the generated task plan but that cannot be directly represented in the map used for navigation, such as areas near doorways where it is preferable that the robot does not stop to perform activities. We demonstrate the performance benefits of our approach on simulated manufacturing tasks in an automated factory. | |
Session 11: Hybrid Planning| Conformant Planning
Task-Aware Waypoint Sampling for Robotic Planning
Authors: Sarah Keren, Gerard Canal and Michael Cashmore
Keywords:
Task and motion planningRoboticsWaypoint sampling
Verifying Plans and Scripts for Robotics Tasks Using Performance Level Profiles
Authors: Alexander Kovalchuk, Shashank Shekhar and Ronen Brafman
Keywords:
Plan verificationProbabilistic-Timed AutomataPerformance-Level Profiles
In-Station Train Dispatching: A PDDL+ Planning Approach
Authors: Matteo Cardellini, Marco Maratea, Mauro Vallati, Gianluca Boleto and Luca Oneto
Keywords:
In-Station Train DispatchingTrain Traffic ControlHybrid Planning
Non-Deterministic Conformant Planning Using a Counterexample-Guided Incremental Compilation to Classical Planning
Authors: Alban Grastien and Enrico Scala
Keywords:
Conformant planningSATCounter-example guided abstraction refinement