Finding an unpredictable target in a workspace with obstacles
Authors:
- S.M. LaValleSLS.M. LaValle
- D. LinDLD. Lin
- L.J. GuibasLGL.J. Guibas
- J.-C. LatombeJLJ.-C. Latombe
- R. MotwaniRMR. Motwani
- 22 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1, 737-742
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Motion planning with uncertainty: the information space approach2002
- A VISIBILITY-BASED PURSUIT-EVASION PROBLEMInternational Journal of Computational Geometry & Applications, 1999
- The Robot Localization ProblemSIAM Journal on Computing, 1997
- Mobile robot self-location using model-image feature correspondenceIEEE Transactions on Robotics and Automation, 1996
- Randomization for robot tasks: Using dynamic programming in the space of knowledge statesAlgorithmica, 1993
- Recontamination does not help to search a graphJournal of the ACM, 1993
- Searching for a Mobile Intruder in a Polygonal RegionSIAM Journal on Computing, 1992
- Robot Motion Planning1991
- The complexity of searching a graphJournal of the ACM, 1988
- Primitives for the manipulation of general subdivisions and the computation of VoronoiACM Transactions on Graphics, 1985