Temporal planning with preferences and time-dependent continuous costs

J Benton, A Coles, A Coles - Proceedings of the International …, 2012 - ojs.aaai.org
Temporal planning methods usually focus on the objective of minimizing makespan.
Unfortunately, this misses a large class of planning problems where it is important to …

Recognition of blurred faces using local phase quantization

T Ahonen, E Rahtu, V Ojansivu… - 2008 19th international …, 2008 - ieeexplore.ieee.org
In this paper, recognition of blurred faces using the recently introduced Local Phase
Quantization (LPQ) operator is proposed. LPQ is based on quantizing the Fourier transform …

Soft goals can be compiled away

E Keyder, H Geffner - Journal of Artificial Intelligence Research, 2009 - jair.org
Soft goals extend the classical model of planning with a simple model of preferences. The
best plans are then not the ones with least cost but the ones with maximum utility, where the …

Planning for human-robot teaming in open worlds

K Talamadupula, J Benton, S Kambhampati… - ACM Transactions on …, 2010 - dl.acm.org
As the number of applications for human-robot teaming continue to rise, there is an
increasing need for planning technologies that can guide robots in such teaming scenarios …

Planning as an iterative process

D Smith - Proceedings of the AAAI Conference on Artificial …, 2012 - ojs.aaai.org
Activity planning for missions such as the Mars Exploration Rover mission presents many
technical challenges, including oversubscription, consideration of time, concurrency …

LPRPG-P: Relaxed plan heuristics for planning with preferences

A Coles, A Coles - Proceedings of the international conference on …, 2011 - ojs.aaai.org
In this paper we present a planner, LPRPG-P, capable of reasoning with the non-temporal
subset of PDDL 3 preferences. Our focus is on computation of relaxed plan based heuristics …

[PDF][PDF] Iterative goal refinement for robotics

M Roberts, S Vattam, R Alford… - ICAPS Workshop on …, 2014 - researchgate.net
Goal Reasoning (GR) concerns actors that assume the responsibility for dynamically
selecting the goals they pursue. Our focus is on modelling an actor's decision making when …

Deterministic oversubscription planning as heuristic search: Abstractions and reformulations

C Domshlak, V Mirkis - Journal of Artificial Intelligence Research, 2015 - jair.org
While in classical planning the objective is to achieve one of the equally attractive goal
states at as low total action cost as possible, the objective in deterministic oversubscription …

Max is more than min: Solving maximization problems with heuristic search

R Stern, S Kiesel, R Puzis, A Felner… - Proceedings of the …, 2014 - ojs.aaai.org
Most work in heuristic search considers problems where a low cost solution is preferred
(MIN problems). In this paper, we investigate the complementary setting where a solution of …

Integrating a closed world planner with an open world robot: A case study

K Talamadupula, J Benton, P Schermerhorn… - Proceedings of the …, 2010 - ojs.aaai.org
In this paper, we present an integrated planning and robotic architecture that actively directs
an agent engaged in an urban search and rescue (USAR) scenario. We describe three …