PLANNING UNDER TIME PRESSURE by Ethan Burns University of New Hampshire, May, 2013 Heuristic search is a technique used pervasively in artificial intelligence and automated planning. Often an agent is given a task that it would like to solve as quickly as possible. It must allocate its time between planning the actions to achieve the task and actually executing them. We call this problem planni...

ION PLANNING IN REAL TIME a dissertation submitted to the department of computer science and the committee on graduate studies of stanford university in partial fulfillment of the requirements for the degree of doctor of philosophy By Richard Washington March 1994 c Copyright 1994 by Richard Washington All Rights Reserved

A planning problem is time-dependent, if the time spent planning affects the uti l i ty of the system's performance. In [Dean and Boddy, 1988], we define a framework for constructing solutions to time-dependent planning problems, called expectation-driven iterative refinement. In this paper, we analyze and solve a moderately complex time-dependent planning problem involving path planning for a ...

We present a novel approach for planning and directing heterogeneous groups of virtual agents based on techniques from linear programming. Our method efficiently identifies the most promising paths in both time and space and provides an optimal distribution of the groups’ members over these paths such that their average traveling time is minimized. The computed space-time plan is combined with ...

Enterprise Resource Planning (ERP) has become one of the competitive advantages for companies around the globe and the dynamic force driving the process of global integration through information. Governmental organizations are increasing their adoption of these systems for various benefits such as integrated real-time information, better administration, and result-based management. Reaching the...

tendency to optimization in last decades has resulted in creating multi-product manufacturing systems. production planning in such systems is difficult, because optimal production volume that is calculated must be consistent with limitation of production system. hence, integration has been proposed to decide about these problems concurrently. main problem in integration is how we can relate pro...

Since the notion of general purpose planning became one of the touchstones of artificial intelligence, surprisingly little improvement has been made in the efficiency of planning algorithms. Efficient high-speed search is essential to most planning algorithms proposed to date: this can only be achieved if the search algorithms used are based on a solid understanding of the search space. The con...