The main focus of our work is the use of classical planning algorithms in service of more complex problems of planning under uncertainty. In particular, we are exploring compilation techniques that allow us to reduce some probabilistic planning problems into variants of classical planning, such as metric planning, resource-bounded planning, and cost-bounded suboptimal planning. Currently, our i...

Residential location choice modeling is one of the areas in transportation planning that attempts to examine households location search behavior incorporating their trade-offs between housing quality, prices or rents, distance to work and other key factors. This brings up the need to come up with methods to logically allocate credible choice alternatives for individuals.This article attempts to...

In this literature review we discuss asynchronous multi agent motion planning. We first introduce fundamental ideas related to asynchronous multi agent motion planning such as asynchronous computation, multi agent systems and motion planning. We then discuss related work in asynchronous systems and motion planning of multi agent systems. We then discuss the application of asynchronous multi age...

The “planning as satisfiability” approach for classical planning establishes a correspondence between planning problems and logical theories, and, consequently, between plans and models. This work proposes a similar framework for contingency planning: considering contingent planning problems where the sources of indeterminism are incomplete knowledge about the initial state, non-inertial fluent...

This paper describes the architecture of a reactive planning system for dynamic environments, which is specifically designed to deal with robot planning problems. The architecture permits many agents to work simultaneously on the same environment and it is aimed at working with incomplete information. Agents have partial knowledge about the world and data soon becomes obsolete because of the ch...

When minimizing makespan during off-line planning, the fastest action sequence to reach a particular state is, by definition, preferred. When trying to reach a goal quickly in on-line planning, previous work has inherited that assumption: the faster of two paths that both reach the same state is usually considered to dominate the slower one. In this short paper, we point out that, when planning...

Ordered Task Decomposition is a new approach to HTN planning that appears to work quite well in a diverse set of real-world planning problems. This paper summarizes what Ordered Task Decomposition is, describes our past and current work on it, and describes our plans for future work.

In the past decade, resilient cities (RCs) have gained extensive attention in academic and political debates as a vision of urban futures. particular, with support Rockefeller Foundation’s Resilient City 100 Program (RC100), number worldwide pushed this concept forward from theory to practice through their RC plans/strategies. However, there is widespread doubt regarding how much holistic idea ...