Constructing Optimal Cyclic Tours for Planar Exploration and Obstacle Avoidance : A Graph Theory Approach

DOI10.1007/978-3-540-74356-9_9zbMath1187.05072OpenAlexW193174915MaRDI QIDQ3564116

J. Yadegar, Abhishek Tiwari, Harish Chandra, Junxian Wang

Publication date: 2 June 2010

Published in: Advances in Cooperative Control and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74356-9_9

zbMATH Keywords

algorithmsHamiltonian cyclesobstaclestiling patternedge adjacency dual graphobstacle configurationPeano-Cesaro triangular tilingplanar autonomous exploration

Mathematics Subject Classification ID

Applications of graph theory (05C90) Combinatorics on words (68R15) Deterministic network models in operations research (90B10) Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45)

Related Items (3)

Monte Carlo algorithm for trajectory optimization based on Markovian readings ⋮ Fastest motion planning for an unmanned vehicle in the presence of accelerating obstacles ⋮ A penalized nonparametric method for nonlinear constrained optimization based on noisy data

This page was built for publication: Constructing Optimal Cyclic Tours for Planar Exploration and Obstacle Avoidance : A Graph Theory Approach