Please use this identifier to cite or link to this item:
|Title:||A greedy strategy for tracking a locally predictable target among obstacles||Authors:||Bandyopadhyay, T.
Ang Jr., M.H.
|Issue Date:||2006||Citation:||Bandyopadhyay, T., Li, Y., Ang Jr., M.H., Hsu, D. (2006). A greedy strategy for tracking a locally predictable target among obstacles. Proceedings - IEEE International Conference on Robotics and Automation 2006 : 2342-2347. ScholarBank@NUS Repository. https://doi.org/10.1109/ROBOT.2006.1642052||Abstract:||Target tracking among obstacles is an interesting class of motion planning problems that combine the usual motion constraints with robot sensors' visibility constraints. In this paper, we introduce the notion of vantage time and use it to formulate a risk function that evaluates the robot's advantage in maintaining the visibility constraint against the target. Local minimization of the risk function leads to a greedy tracking strategy. We also use simple velocity prediction on the target to further improve tracking performance. We compared our new strategy with earlier work in extensive simulation experiments and obtained much improved results. © 2006 IEEE.||Source Title:||Proceedings - IEEE International Conference on Robotics and Automation||URI:||http://scholarbank.nus.edu.sg/handle/10635/43243||ISBN:||0780395069||ISSN:||10504729||DOI:||10.1109/ROBOT.2006.1642052|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Oct 21, 2021
WEB OF SCIENCETM
checked on Oct 13, 2021
checked on Oct 14, 2021
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.