Name
Abstract | ||
|---|---|---|
Current motion planners, such as the ones available in ROS MoveIt, can solve difficult motion planning problems. However, these planners are not practical in unstructured, rapidly-changing environments. First, they assume that the environment is well-known, and static during planning and execution. Second, they do not support temporal constraints, which are often important for synchronization between a robot and other actors. Third, because many popular planners generate completely new trajectories for each planning problem, they do not allow for representing persistent control policy information associated with a trajectory across planning problems. We present Chekhov, a reactive, integrated motion planning and execution system that addresses these problems. Chekhov uses a Tube-based Roadmap in which the edges of the roadmap graph are families of trajectories called flow tubes, rather than the single trajectories commonly used in roadmap systems. Flow tubes contain control policy information about how to move through the tube, and also represent the dynamic limits of the system, which imply temporal constraints. This, combined with an incremental APSP algorithm for quickly finding paths in the roadmap graph, allows Chekhov to operate in rapidly changing environments. Testing in simulation, and with a robot testbed has shown improvement in planning speed and motion predictability over current motion planners. |
Year | Venue | Field |
|---|---|---|
2015 | IJCAI | Motion planning,Graph,Predictability,Synchronization,Overcurrent,Computer science,Testbed,Real-time computing,Robot,Trajectory |
DocType | Citations | PageRank |
Conference | 2 | 0.39 |
References | Authors | |
5 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Andreas G. Hofmann | 1 | 24 | 6.21 |
| Enrique Fernández-González | 2 | 6 | 1.61 |
| Justin Helbert | 3 | 2 | 0.39 |
| S. D.G. Smith | 4 | 83 | 7.94 |
| B C Williams | 5 | 2404 | 426.13 |