Improving Heuristics of Optimal Perception Planning Using Visibility Maps

In this paper we consider the problem of motion planning for perception of a target position. A robot has to move to a position from where it can sense the target, while minimizing both motion and perception costs. The problem of finding paths for robots executing perception tasks can be solved optimally using informed search. In perception path planning, the solution for the perception task considering a straight line without obstacles is used as heuristic. In this work, we propose a heuristic that can improve the search efficiency. In order to improve the node expansion using a more informed search, we use the robot Approximate Visibility Map (A-VM), which is used as a representation of the observability capability of a robot in a given environment. We show how the critical points used in A-VM provide information on the geometry of the environment, which can be used to improve the heuristic, increasing the search efficiency. The critical points allow a better estimation of the minimum motion and perception cost for targets in non-traversable regions that can only be sensed from further away. Finally, we show the contributed heuristic dominates the common heuristic (based on the euclidian distance), and present the results of the performance increase in terms of node expansion.

[1]  Michael Beetz,et al.  Real-time perception-guided motion planning for a personal robot , 2009, 2009 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[2]  R. Alami,et al.  Mightability maps: A perceptual level decisional framework for co-operative and competitive human-robot interaction , 2010, 2010 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[3]  Manuela M. Veloso,et al.  Multi-robot Planning Using Robot-Dependent Reachability Maps , 2015, ROBOT.

[4]  Gaurav S. Sukhatme,et al.  Experiments with a Large Heterogeneous Mobile Robot Team: Exploration, Mapping, Deployment and Detection , 2006, Int. J. Robotics Res..

[5]  Gaurav S. Sukhatme,et al.  A probabilistic framework for next best view estimation in a cluttered environment , 2014, J. Vis. Commun. Image Represent..

[6]  Manuela M. Veloso,et al.  PA*: Optimal Path Planning for Perception Tasks , 2016, ECAI.

[7]  Manuela M. Veloso,et al.  Localization and navigation of the CoBots over long-term deployments , 2013, Int. J. Robotics Res..

[8]  Danica Kragic,et al.  Integrating Active Mobile Robot Object Recognition and SLAM in Natural Environments , 2006, 2006 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[9]  Jingjing Du,et al.  Rao-Blackwellized Particle Filters multi robot SLAM with unknown initial correspondences and limited communication , 2010, 2010 IEEE International Conference on Robotics and Automation.

[10]  Robert Eidenberger,et al.  Active perception and scene modeling by planning with probabilistic 6D object poses , 2010, 2010 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[11]  Jan Faigl,et al.  Approximate Solution of the Multiple Watchman Routes Problem With Restricted Visibility Range , 2010, IEEE Transactions on Neural Networks.