TY - GEN
T1 - Hierarchical en-route planning under the extended belief-desire-intention (E-BDI) framework
AU - Kim, Sojung
AU - Son, Young Jun
AU - Tian, Ye
AU - Chiu, Yi Chang
AU - David Yang, C. Y.
PY - 2014
Y1 - 2014
N2 - 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 E-BDI 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.
AB - 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 E-BDI 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.
KW - Agent-based simulation
KW - Belief-desire-intention
KW - En-route planning
KW - Hierarchical route planning
UR - http://www.scopus.com/inward/record.url?scp=84910100305&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84910100305&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:84910100305
T3 - IIE Annual Conference and Expo 2014
SP - 547
EP - 556
BT - IIE Annual Conference and Expo 2014
PB - Institute of Industrial Engineers
T2 - IIE Annual Conference and Expo 2014
Y2 - 31 May 2014 through 3 June 2014
ER -