Planning in real-world environments can be challenging for intelligent robots due to incomplete domain knowledge that results from unpredictable domain dynamism, and due to lack of global observability. Action language BC can be used for planning by formalizing the preconditions and (direct and indirect) effects of actions, and is especially suited for planning in robotic domains by incorporating defaults with the incomplete domain knowledge. However, planning with BC is very computationally expensive, especially when action costs are considered. We introduce algorithm PlanHG for formalizing BC domains at different abstraction levels in order to trade optimality for significant efficiency improvement when aiming to minimize overall plan cost. We observe orders of magnitude improvement in efficiency compared to a standard “flat” planning approach.
CITATION STYLE
Zhang, S., Yang, F., Khandelwal, P., & Stone, P. (2015). Mobile robot planning using action language BC with an abstraction hierarchy. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9345, pp. 502–516). Springer Verlag. https://doi.org/10.1007/978-3-319-23264-5_42
Mendeley helps you to discover research relevant for your work.