Abstract
This paper addresses path planning with real-time reaction to environmental uncertainty. The environment is represented as a graph and is uncertain in that the edges of the graph are unknown to the robot a priori. Instead, the robots prior information consists of a distribution over candidate edge sets. At each vertex, the robot can take a measurement to determine the presence or absence of an edge.Within this model, the Reactive Planning Problem (RPP) provides the robot with a start location and a goal location and asks it to compute a policy that minimizes the expected travel and observation cost. In contrast to computing paths that maximize the probability of success, we focus on complete policies (i.e., policies that produce a path, or determine no such path exists). We prove that the RPP is NP-Hard and provide a suboptimal, but computationally e cient, solution. This solution, based on mutual information, returns a complete policy and a bound on the gap between the policy’s expected cost and the optimal. Finally, simulations are run on a flexible factory scenario to demonstrate the scalability of the proposed approach.
Keywords
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Binney, J., Sukhatme, G.S.: Branch and bound for informative path planning. In: ICRA, Citeseer (2012) 2147–2154
Yu, J., Schwager, M., Rus, D.: Correlated orienteering problem and its application to informative path planning for persistent monitoring tasks. In: International Conference on Intelligent Robots and Systems, IEEE (2014) 342–349
Hollinger, G.A., Englot, B., Hover, F.S., Mitra, U., Sukhatme, G.S.: Active planning for underwater inspection and the benefit of adaptivity. The International Journal of Robotics Research (2012) 3–18
Javdani, S., Chen, Y., Karbasi, A., Krause, A., Bagnell, D., Srinivasa, S.S.: Near optimal bayesian active learning for decision making. In: AISTATS. (2014) 430–438
Dames, P., Schwager, M., Kumar, V., Rus, D.: A decentralized control policy for adaptive information gathering in hazardous environments. In: 51st IEEE Conference on Decision and Control (CDC), IEEE (2012) 2807–2813
Bhattacharya, S., Ghrist, R., Kumar, V.: Persistent homology for path planning in uncertain environments. IEEE Transactions on Robotics 31(3) (2015) 578–590
Papadimitriou, C.H., Tsitsiklis, J.N.: The complexity of markov decision processes. Mathematics of operations research 12(3) (1987) 441–450
LaValle, S.M.: Planning algorithms. Cambridge university press (2006)
Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE transactions on Systems Science and Cybernetics 4(2) (1968) 100–107
Koenig, S., Likhachev, M.: Fast replanning for navigation in unknown terrain. IEEE Transactions on Robotics 21(3) (2005) 354–363
Lim, Z.W., Hsu, D., Lee, W.S.: Adaptive informative path planning in metric spaces. The International Journal of Robotics Research 35(5) (2015) 585–598
Andreatta, G., Romeo, L.: Stochastic shortest paths with recourse. Networks 18(3) (1988) 193–204
Papadimitriou, C.H., Yannakakis, M.: Shortest paths without a map. Theoretical Computer Science 84(1) (1991) 127–150
Polychronopoulos, G.H., Tsitsiklis, J.N.: Stochastic shortest path problems with recourse. Networks 27(2) (1996) 133–143
Issac, P., Campbell, A.M.: Shortest path problem with arc failure scenarios. EURO Journal on Transportation and Logistics (2015) 1–25
Dames, P.M., Schwager, M., Rus, D., Kumar, V.: Active magnetic anomaly detection using multiple micro aerial vehicles. IEEE Robotics and Automation Letters 1(1) (2016) 153–160
Charrow, B., Kumar, V., Michael, N.: Approximate representations for multirobot control policies that maximize mutual information. Autonomous Robots 37(4) (2014) 383–400
Chakaravarthy, V.T., Pandit, V., Roy, S., Awasthi, P., Mohania, M.: Decision trees for entity identification: approximation algorithms and hardness results. In: Proceedings ACM Symp. on Principles of Database Systems, ACM (2007) 53–62
Suhov, Y., Stuhl, I., Sekeh, S.Y., Kelbert, M.: Basic inequalities for weighted entropies. Aequationes mathematicae (2015) 1–32
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this chapter
Cite this chapter
MacDonald, R.A., Smith, S.L. (2020). Reactive Motion Planning in Uncertain Environments via Mutual Information Policies. In: Goldberg, K., Abbeel, P., Bekris, K., Miller, L. (eds) Algorithmic Foundations of Robotics XII. Springer Proceedings in Advanced Robotics, vol 13. Springer, Cham. https://doi.org/10.1007/978-3-030-43089-4_17
Download citation
DOI: https://doi.org/10.1007/978-3-030-43089-4_17
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-43088-7
Online ISBN: 978-3-030-43089-4
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)