Planning for temporally extended goals
Annals of Mathematics and Artificial Intelligence
Planning with first-order temporally extended goals using heuristic search
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Simultaneous heuristic search for conjunctive subgoals
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
The FF planning system: fast plan generation through heuristic search
Journal of Artificial Intelligence Research
The metric-FF planning system: translating "Ignoring delete lists" to numeric state variables
Journal of Artificial Intelligence Research
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Using Temporal Logic to Integrate Goals and Qualitative Preferences into Agent Programming
Declarative Agent Languages and Technologies VI
Anytime heuristic search for partial satisfaction planning
Artificial Intelligence
Having Services "YourWay!": Towards User-Centric Composition of Mobile Services
Future Internet --- FIS 2008
Learning in Planning with Temporally Extended Goals and Uncontrollable Events
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Incremental heuristic search for planning with temporally extended goals and uncontrollable events
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Soft goals can be compiled away
Journal of Artificial Intelligence Research
Web service composition with user preferences
ESWC'08 Proceedings of the 5th European semantic web conference on The semantic web: research and applications
Specifying and computing preferred plans
Artificial Intelligence
An agent specific planning algorithm
Expert Systems with Applications: An International Journal
Analysing the PDDL language for argumentation-based negotiation planning
ICCSA'12 Proceedings of the 12th international conference on Computational Science and Its Applications - Volume Part III
Hi-index | 0.00 |
In this paper we propose a suite of techniques for planning with temporally extended preferences (TEPs). To this end, we propose a method for compiling TEP planning problems into simpler domains containing only final-state (simple) preferences and metric functions. With this simplified problem in hand, we propose a variety of heuristic functions for planning with final-state preferences, together with an incremental best-first planning algorithm. A key feature of the planning algorithm is its ability to prune the search space. We identify conditions under which our planning algorithm will generate optimal plans. We implemented our algorithm as an extension to the TLPLAN planning system and report on extensive testing performed to evaluate the effectiveness of our heuristics and algorithm. Our planner, HPLAN-P, competed in the 5th International Planning Competition, achieving distinguished performance in the qualitative preferences track.