Computing minimum length paths of a given homotopy class
Computational Geometry: Theory and Applications
ISSAC '98 Proceedings of the 1998 international symposium on Symbolic and algebraic computation
Algorithm 145: Adaptive numerical integration by Simpson's rule
Communications of the ACM
Introduction to algorithms
Safe Cooperative Robot Dynamics on Graphs
SIAM Journal on Control and Optimization
Eighteenth national conference on Artificial intelligence
Probabilistic Robotics (Intelligent Robotics and Autonomous Agents)
Probabilistic Robotics (Intelligent Robotics and Autonomous Agents)
Coverage and hole-detection in sensor networks via homology
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
GNU Scientific Library Reference Manual - 2nd Edition
GNU Scientific Library Reference Manual - 2nd Edition
Nonpositive Curvature and Pareto Optimal Coordination of Robots
SIAM Journal on Control and Optimization
Motion planning in urban environments
Journal of Field Robotics
Efficient triangulation-based pathfinding
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Occlusion detection and tracking method based on bayesian decision theory
PSIVT'06 Proceedings of the First Pacific Rim conference on Advances in Image and Video Technology
Hi-index | 0.00 |
We consider planning problems on Euclidean spaces of the form 驴, where $\widetilde{\mathcal{O}}$ is viewed as a collection of obstacles. Such spaces are of frequent occurrence as configuration spaces of robots, where $\widetilde{\mathcal{O}}$ represent either physical obstacles that the robots need to avoid (e.g., walls, other robots, etc.) or illegal states (e.g., all legs off-the-ground). As state-planning is translated to path-planning on a configuration space, we collate equivalent plannings via topologically-equivalent paths. This prompts finding or exploring the different homology classes in such environments and finding representative optimal trajectories in each such class. In this paper we start by considering the general problem of finding a complete set of easily computable homology class invariants for (N驴驴驴1)-cycles in (驴. We achieve this by finding explicit generators of the (N驴驴驴1) st de Rham cohomology group of this punctured Euclidean space, and using their integrals to define cocycles. The action of those dual cocycles on (N驴驴驴1)-cycles gives the desired complete set of invariants. We illustrate the computation through examples. We then show, for the case when N驴=驴2, due to the integral approach in our formulation, this complete set of invariants is well-suited for efficient search-based planning of optimal robot trajectories with topological constraints. In particular, we show how to construct an `augmented graph', $\widehat{\mathcal{G}}$ , from an arbitrary graph $\mathcal{G}$ in the configuration space. A graph construction and search algorithm can hence be used to find optimal trajectories in different topological classes. Finally, we extend this approach to computation of invariants in spaces derived from (驴by collapsing a subspace, thereby permitting application to a wider class of non-Euclidean ambient spaces.