On-line path planning in an unknown polygonal environment

DOI10.1016/J.INS.2003.05.009MaRDI QIDQ707338zbMATH OpenOpenAlexFDO

Authors Amitava Datta, Subbiah Soundaralakshmi

Publication date 9 February 2005

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ins.2003.05.009

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Artificial intelligence for robotics (68T40)

Recommendations

• scientific article; zbMATH DE number 2185606
• Going home through an unknown street
• Competitive exploration of rectilinear polygons.
• Walking streets faster
• scientific article; zbMATH DE number 1617273

Cites work

• scientific article; zbMATH DE number 1256766 (Why is no real title available?)
• scientific article; zbMATH DE number 1003229 (Why is no real title available?)
• scientific article; zbMATH DE number 871902 (Why is no real title available?)
• Competitive searching in a generalized street
• Competitive searching in polygons—Beyond generalised streets
• Generalized streets revisited
• On information invariants in robotics
• Searching in the plane
• Shortest paths without a map
• Walking an unknown street with bounded detour
• Walking streets faster

Cited in

(10)

• Online algorithms for searching and exploration in the plane
• Searching and on-line recognition of star-shaped polygons.
• REACHING A POLYGON WITH DIRECTIONAL UNCERTAINTY
• How to learn an unknown environment. I
• Generalized streets revisited
• Competitive disconnection detection in on-line mobile robot navigation
• Function-segment artificial moment method for sensor-based path planning of single robot in complex environments
• scientific article; zbMATH DE number 1617273 (Why is no real title available?)
• scientific article; zbMATH DE number 2185606 (Why is no real title available?)
• Approximation and Online Algorithms

This page was built for publication: On-line path planning in an unknown polygonal environment

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