We consider the Retail Planning Problem in which the retailer chooses suppliers, and determines the production, distribution and inventory planning for products with uncertain demand in order to minimize total expected costs. This problem is often faced by large retail chains that carry private label products. We formulate this problem as a convex mixed integer program and show that it is stron...

The synthesis of elevator control commands i a difficult problem when new service requirements such as VIP service, acccsu restrictions, nonstop travel etc. have to bc individually tailored to each passenger. AI plamling technology offers a very elegant and flexible solution because the possible actions of a control system can be made explicit and their preconditions and effects can bc specifie...

Sequential control is a common control problem in industry. Despite its importance fairly little theoretical research has been devoted to this problem. We study a subclass of sequential control problems, which we call the SAS-PUBS class, and present a planning algorithm for this class. The algorithm is developed using formalism from artiicial intelligence (AI). For planning problems in the SAS-...

We consider a dynamic planning problem for the transport of elderly and disabled people. The focus is on a decision to make one day ahead: which requests to serve with own vehicles, and which ones to assign to subcontractors, under uncertainty of late requests which are gradually revealed during the day of operation. We call this problem the Dynamic Day-ahead Paratransit Planning problem. The d...

.\bstract-\Ve consider the problem of determinmg the optim,A timing and king ui ns\+ i’aciilt! conctruction under a continuous technology model of possible sizes. The rate of conLergen<r of ihurt tu lung run optimal policies is established 2nd plannin g horizon implication\ are explored. KC aI\u pr<,cn: Jn rtficient algorithm for solving such problems fur all horizon times by solbing a jingle h...

Continually increasing demands for high-quality videoconferencing have brought a problem of fully automated environment setup. A media streams planning problem forms an important part of this issue. As the multimedia streams are extremely bandwidth-demanding, their transmission has to be planned with respect to available capacities of network links and the plan also needs to be optimal in terms...

The SCO planning problem is a tightly coupled planning and scheduling problem. We have identified some important features underlying this problem including the coordination between actions, maintaining temporal and numerical constraints and the optimization metric. These features have been modeled separately and experimented with the state-of-the-art planners, Crikey, Lpg-td and SgPlan5. Howeve...

Many robot motion planning problems can be described as a combination of motion through relatively sparsely filled regions of configuration space and motion through tighter passages. Sample-based planners perform very effectively everywhere but in the tight passages. In this paper, we provide a method for parametrically describing workspace arrangements that are difficult for planners, and then...

In this paper, we translate sentence generation from TAG grammars with semantic and pragmatic information into a planning problem by encoding the contribution of each word declaratively and explicitly. This allows us to tap into the recent performance improvements in off-the-shelf planners. It also opens up new perspectives on referring expression generation and the relationship between languag...

A problem domain can be represented as a hierarchy of abstraction spaces in which successively finer levels of detail are introduced. The problem solver ABSTRIPS, a modification of STRIPS, can define an abstraction space hierarchy from the STRIPS representation of a problem domain, and it can utilize the hierarchy in solving problems. Examples of the system's performance are presented that demo...