Planning and scheduling research is becoming an increasingly interesting topic in the Arti...cial Intelligence area, because of its immediate application to real problems. Although the last few years have seen dramatic advances in planning systems, they have not seen the same advances in the methods of solving planning and scheduling problems. In this paper, an intuitive way of integrating inde...

A l though AI p lann ing techniques can potent ia l l y be useful in several manufac tur ing domains, this potent ia l remains largely unrealized. In order to adapt AI p lanning techniques to manufac tu r ing , i t is impo r tan t to develop more realistic and robust ways to address issues impo r t an t to manufac tur ing engineers. Furthermore, by invest igat ing such issues, AI researchers ma...

This paper describes two approaches that enable the AI Planner LPGP to reason about domains with exogenous events and goals with duration: the first investigates how such domains may be encoded using the planning domain definition language PDDL2.1 level 3, while the second involves directly modifying LPGP. Both approaches have been tested in a number of domains and conclusions are drawn about t...

In the course of developing intelligent synthetic forces and commanders we have learned a number of lessons about what it takes to produce flexible group behavior: (1) simply putting together entities with intelligent, reactive behavior is not sufficient to produce team or group behaviors; (2) commanders need the ability to plan or project into the future; but, (3) planning alone is not suffici...

Corresponding Author: Hea Choon Ngo Faculty of Information and Communication Technology, Universiti Teknikal Malaysia Melaka, 76100, Melaka, Malaysia Email: [email protected] Abstract: Planning is widely been used in many areas such as in medicine, administration, business, logistics, education, environment and family matters. In automated planning research, the word “plans” refers specifica...

Numerous path planning solutions have been proposed to solve the navigation problem in static environments, potentially populated with dynamic obstacles. However, in dynamic environments, moving objects can be used to reach new locations. In this paper, we propose an online planning algorithm for dynamically changing environments with unknown evolution. This method focuses on accessibility and ...

This paper presents two automatic cellular network design algorithms which determine the favourable positions of transmitters with respect to co-channel interference (CCI). The proposed methods are capable of maximizing the average CCI ratio in the planning region while optimizing the covered teletraac demand. Additionally, we investigate how the proposed algorithms can be extended for locating...

In CPP, we are given a set of actions (assumed deterministic in this paper), a distribution over initial states, a goal condition, and a real value 0 < θ ≤ 1. We seek a plan π such that following its execution, the goal probability is at least θ. Motivated by the success of the translation-based approach for conformant planning, introduced by Palacios and Geffner, we suggest a new compilation s...

The Space Propulsion Robust Analysis Tool (SPRAT) project is developing technology support Space Shuttle ground operations personnel as they manage and carry out mission preparation analysis and related analyses in missions. The initial SPRAT prototype provides intelligent support and automation for mission analysis set-up and documentation for Propulsion consumables analysis. SPRAT models the ...

ion Heuristics An abstraction of a planning domain Σ is a γ-preserving homomorphism from Σ onto a smaller planning domain Σ′. For each planning problem P = (Σ, s0, g), this defines a corresponding abstraction P ′ = (Σ′, s0, g ′); and if we let c∗ denote the cost of an optimal solution to a planning problem, then it follows that c∗(P ′) ≤ c∗(P ). If Σ′ is simple enough that we can compute c∗(P ′...