Constructing optimal cyclic tours for planar exploration and obstacle avoidance : A graph theory approach

DOI10.1007/978-3-540-74356-9_9MaRDI QIDQ3564116zbMATH OpenOpenAlexFDO

Authors Abhishek Tiwari, Harish Chandra, J. Yadegar, 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

algorithmsedge adjacency dual graphHamiltonian cyclesobstacle configurationobstaclesPeano-Cesaro triangular tilingplanar autonomous explorationtiling pattern

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1947407
• scientific article; zbMATH DE number 1559557
• Exploring unknown environments with obstacles
• Exploring Unknown Environments
• Optimal Exploration of Terrains with Obstacles

Cited in

(3)

• Fastest motion planning for an unmanned vehicle in the presence of accelerating obstacles
• Monte Carlo algorithm for trajectory optimization based on Markovian readings
• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3564116)