Hierarchical En-Route Planning under the Extended Belief-Desire- Intention (E-BDI) Framework

En-route planning is a dynamic planning process to find the optimal route (e.g., shortest route) while driving. The goal of this paper is to mimic a realistic drivers’ en-route planning behavior under the situations with incomplete information about road conditions using the Extended Belief-Desire-Intention (E-BDI) framework. The proposed EBDI based en-route planning is able to find a new route to the destination based on the predicted road conditions inferred by drivers’ own psychological reasoning. A main challenge of such a detailed E-BDI model is a high computational demand needed to execute a large scale road network, which is typical in a big city. To mitigate such a high computational demand, a hierarchical route planning approach is also proposed in this work. The proposed approach has been implemented in Java-based E-BDI modules and DynusT® traffic simulation software, where a real traffic data of Phoenix, Arizona is used. To validate the proposed hierarchical approach, the performance of the en-route planning modules under the different aggregation levels is compared in terms of their computational efficiency and modeling accuracy. The validation results reveal that the proposed en-route planning approach efficiently generates a realistic route plan with individual driver’s prediction of the road conditions.

[1]  Seungho Lee,et al.  An integrated human decision making model for evacuation scenarios under a BDI framework , 2010, TOMC.

[2]  Richard E. Neapolitan,et al.  Learning Bayesian networks , 2007, KDD '07.

[3]  Eduardo Sontag,et al.  Sample Complexity for Learning , 1996 .

[4]  S. Mabu,et al.  Hierarchical efficient route planning in road networks , 2011, 2011 IEEE International Conference on Systems, Man, and Cybernetics.

[5]  Eytan Domany,et al.  On the Number of Samples Needed to Learn the Correct Structure of a Bayesian Network , 2006, UAI.

[6]  Robert Sedgewick,et al.  Algorithms in Java, Third Edition, Parts 1-4: Fundamentals, Data Structures, Sorting, Searching , 1998 .

[7]  Elke A. Rundensteiner,et al.  Hierarchical Encoded Path Views for Path Query Processing: An Optimal Model and Its Performance Evaluation , 1998, IEEE Trans. Knowl. Data Eng..

[8]  S. P. Lloyd,et al.  Least squares quantization in PCM , 1982, IEEE Trans. Inf. Theory.

[9]  Kotaro Hirasawa,et al.  An efficient preprocessing method for suboptimal route computation , 2011 .

[10]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[11]  Young-Jun Son,et al.  Modeling Human Interactions with Learning under the Extended Belief-Desire-Intention Framework , 2012 .

[12]  Anand S. Rao,et al.  Decision Procedures for BDI Logics , 1998, J. Log. Comput..

[13]  Xiaobing Zhao,et al.  Extended BDI Framework for Modelling Human Decision-Making in Complex Automated Manufacturing Systems , 2008 .

[14]  W. Hoeffding.  Probability Inequalities for sums of Bounded Random Variables , 1963 .

[15]  Nir Friedman,et al.  On the Sample Complexity of Learning Bayesian Networks , 1996, UAI.

[16]  David M Levinson,et al.  An Agent-Based Route Choice Model , 2007 .

[17]  Sanjoy Dasgupta,et al.  The Sample Complexity of Learning Fixed-Structure Bayesian Networks , 1997, Machine Learning.