Adaptive informative path planning in metric spaces
نویسندگان
چکیده
منابع مشابه
Adaptive Informative Path Planning in Metric Spaces
In contrast to classic geometric motion planning, informative path planning (IPP) seeks a path for a robot to sense the world and gain information. In adaptive IPP, the robot chooses the next sensing location conditioned on all information acquired so far, and the robot’s goal is to minimize the travel cost required for identifying a true hypothesis. Adaptive IPP is NP-hard, because the robot m...
متن کاملNonmyopic Adaptive Informative Path Planning for Multiple Robots
Many robotic path planning applications, such as search and rescue, involve uncertain environments with complex dynamics that can be only partially observed. When selecting the best subset of observation locations subject to constrained resources (such as limited time or battery capacity) it is an important problem to trade off exploration (gathering information about the environment) and explo...
متن کاملTriangle inequalities in path metric spaces
We study side-lengths of triangles in path metric spaces. We prove that unless such a space X is bounded, or quasi-isometric to R+ or to R , every triple of real numbers satisfying the strict triangle inequalities, is realized by the side-lengths of a triangle in X . We construct an example of a complete path metric space quasi-isometric to R2 for which every degenerate triangle has one side wh...
متن کاملNonmyopic Informative Path Planning in Spatio-Temporal Models
In many sensing applications we must continuously gather information to provide a good estimate of the state of the environment at every point in time. A robot may tour an environment, gathering information every hour. In a wireless sensor network, these tours correspond to packets being transmitted. In these settings, we are often faced with resource restrictions, like energy constraints. The ...
متن کاملPath Planning in Expansive Con guration Spaces
We introduce the notion of expansiveness to characterize a family of robot connguration spaces whose connectivity can be eeectively captured by a roadmap of randomly-sampled milestones. The analysis of expansive connguration spaces has inspired us to develop a new randomized planning algorithm. This new algorithm tries to sample only the portion of the connguration space that is relevant to the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The International Journal of Robotics Research
سال: 2015
ISSN: 0278-3649,1741-3176
DOI: 10.1177/0278364915596378