Abstract
Transportation planning and path planning are hot research topics which can be evidenced by their frequent and repeated presence in the benchmark test in International Planning Competition. However, most of the benchmark test examples only consider the static planning problems, whose state transitions are only caused by the actions of the planners. In this paper, we will discuss the dynamic version and introduce the formalization of the Period/Dynamic planning problem. Then, we will prove that the computational complexity is EXPSPACE-Complete.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
