Generating diverse plans to handle unknown and partially known user preferences

Nguyen, Tuan Anh; Do, Minh; Gerevini, Alfonso; Serina, Ivan; Srivastava, Biplav; Kambhampati, Subbarao

doi:10.1016/j.artint.2012.05.005

Cited by 63 publications

(84 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Constraint (8) requires that the first advisory be an optimal advisory for a CSA problem instance with configuration constraints C and traffic situation data T . Constraint (9) requires that all of the additional advisories achieve a cost value within a fraction ε of the minimum cost. Finally, constraint (10) requires that each pair of advisories be sufficiently different according to an advisory difference metric Φ : C × C → R + .…”

Section: Multiple Advisories Problem Statementmentioning

confidence: 99%

An Approach for Finding Multiple Area of Specialization Configuration Advisories

Bloem

Bambos

2013

2013 Aviation Technology, Integration, and Operations Conference

View full text Add to dashboard Cite

Area of specialization supervisors dynamically configure a set of air traffic control resources so that air traffic in the area can operate safely and efficiently. These resources include airspace sectors, air traffic control positions staffed by controllers, and physical air traffic control equipment. In this paper, we motivate and demonstrate an approach for finding multiple advisories that can assist area supervisors as they accomplish this task. The first motivating factor is that a preference for multiple good and also distinct advisories has been documented in similar contexts, including some air traffic management problems. The second factor that motivates our approach is that the model, problem statement, and algorithm used to generate a single advisory are incomplete and do not perfectly represent reality. The third factor, which we speculate is primarily a result of the second factor, is that area supervisors have indicated a preference for multiple (usually two or three) advisories over a single advisory. Area supervisors have further indicated that each proposed advisory should be different from the other proposed advisories. We investigate the set of advisories that perform best according to a particular objective function for some realistic problem instances. The best few advisories are typically not meaningfully different and therefore should not be presented together to supervisors, and this is the fourth and final factor that motivates our approach. Based on these motivating factors, we define a problem statement which requests multiple good advisories that are all sufficiently different from each other. We briefly describe a heuristic algorithm that was developed for this problem. To more concretely illustrate and motivate the proposed approach, we present the advisories provided by this algorithm for a sample problem instance. We also demonstrate that the proposed heuristic can find feasible second advisories for as many realistic problem instances (15 of 18) as a nearly-exhaustive search. When executed on a desktop workstation computer, the proposed heuristic returns advisories for these realistic problem instances in less than one second per problem instance.

show abstract

Section: Multiple Advisories Problem Statementmentioning

confidence: 99%

An Approach for Finding Multiple Area of Specialization Configuration Advisories

Bloem

Bambos

2013

2013 Aviation Technology, Integration, and Operations Conference

View full text Add to dashboard Cite

show abstract

“…As in our case, the metric is based on the notion of distance between two plans: given two plans π and π the distance is given by the sum of the number of actions that are in π but not in π and the number of the actions that are in π but not in π, over the total number of actions. The same distance is also used in [33] for finding diverse plans. In this paper we have proposed an alternative measure of the plan stability which, besides the common actions, also accounts for the order with which the actions appear and their similarities (where the similarity is captured by the relation between the MMA and the modalities it encompasses).…”

Section: Related Workmentioning

confidence: 99%

“…Meaning that when the order of the actions is significant, our measure is more accurate than the stability proposed in [9], even without the notion of MMA. In [33] there are actually other distance measures upon which the concept of stability can be built. They consider causal relations as well as state trajectories.…”

Section: Related Workmentioning

confidence: 99%

Robust plan execution via reconfiguration and replanning

Scala

Micalizio

Torasso

2015

AIC

View full text Add to dashboard Cite

Acting in real world may be a difficult task for an agent, either software or robotic, because unexpected contingencies may arise at any step of the execution. Previous approaches to robust plan execution consider propositional goals to be achieved and time constraints to be satisfied. However, realistic plans must obey to constraints on continuous/consumable resources, too.To face the complexity in handling these resources, the paper proposes the notion of Multi Modality Action (MMA). The model allows to explicitly express the multiple execution modalities in which a given action can be executed; each execution modality models requirements/consequences on the involved consumable resources when that modality is selected. Relying on the MMA notion, the paper presents how the repair problem can be seen as a problem of reconfiguring actions modalities, and how it can be solved by exploiting a CSP encoding.The MMAs are employed by a new continual planner, FLEX-RR, which, exploiting the synergy from the reconfiguration and a numeric planning mechanism can efficiently repair on the fly the plan keeping it rather stable. An empirical analysis performed on three numeric planning domains, confirms the large benefits of FLEX-RR in terms of competence, efficiency and stability of the repaired plan.

show abstract

“…Finally, using only PEG of goal relations worsen the solved instances. As defined in (Nguyen et al 2012), the plan stability between two plans π and π is equal to the plan distance between π and π, i.e. the number of actions that are in π and not in π plus the number of actions that are in π and not in π (Fox et al 2006), divided by the sum of the number of actions of π and π.…”

Section: Experimental Analysismentioning

confidence: 99%

Identifying and Exploiting Features for Effective Plan Retrieval in Case-Based Planning

Vallati¹,

Serina²,

Saetti³

et al. 2016

Self Cite

View full text Add to dashboard Cite

Case-Based planning can fruitfully exploit knowledge gained by solving a large number of problems, storing the corresponding solutions in a plan library and reusing them for solving similar planning problems in the future. Case-based planning is extremely effective when similar reuse candidates can be efficiently chosen. In this paper, we study an innovative technique based on planning problem features for efficiently retrieving solved planning problems (and relative plans) from large plan libraries. Since existing planning features are not always able to effectively distinguish between problems within the same planning domain, we introduce a new class of features. Our experimental analysis shows that the proposed features-based retrieval approach can significantly improve the performance of a state-of-theart case-based planning system.

show abstract

Generating diverse plans to handle unknown and partially known user preferences

Cited by 63 publications

References 26 publications

An Approach for Finding Multiple Area of Specialization Configuration Advisories

An Approach for Finding Multiple Area of Specialization Configuration Advisories

Robust plan execution via reconfiguration and replanning

Identifying and Exploiting Features for Effective Plan Retrieval in Case-Based Planning

Contact Info

Product

Resources

About