On-line path planning in an unknown polygonal environment
From MaRDI portal
Publication:707338
DOI10.1016/J.INS.2003.05.009zbMATH Open1094.68102OpenAlexW2092411305MaRDI QIDQ707338FDOQ707338
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
Recommendations
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Artificial intelligence for robotics (68T40)
Cites Work
- Searching in the plane
- Shortest paths without a map
- Walking an unknown street with bounded detour
- Title not available (Why is that?)
- Competitive searching in a generalized street
- Title not available (Why is that?)
- Generalized streets revisited
- Walking streets faster
- Competitive searching in polygons—Beyond generalised streets
- On information invariants in robotics
- Title not available (Why is that?)
Cited In (10)
- Competitive disconnection detection in on-line mobile robot navigation
- Generalized streets revisited
- Title not available (Why is that?)
- Title not available (Why is that?)
- REACHING A POLYGON WITH DIRECTIONAL UNCERTAINTY
- Online algorithms for searching and exploration in the plane
- Searching and on-line recognition of star-shaped polygons.
- Function-segment artificial moment method for sensor-based path planning of single robot in complex environments
- Approximation and Online Algorithms
- How to learn an unknown environment. I
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)