eal-Time Search Algorit
نویسندگان
چکیده
A real-time AI problem solver performs a task or a set of tasks in two phases: planning and execution. Under real-time constraints, a real-time AI problem solver must balance the planning and the execution phases of its operation to comply with deadlines. This paper provides a methodology for specification and analysis of real-time AI problems and problem solvers. This methodology is demonstrated via domain analysis of the real-time path planning problem and via algorithm analysis of DYNORAII and RTA* [ 11. We provide new results on worst-case complexity of the problem. We also provide experimental evaluation of DYNORAII and RTA* for deadline compliance.
منابع مشابه
A Feasible Algorithm for Typing in Elementary Affine Logic
We give a new type inference algorithm for typing lambda-terms in Elementary Affine Logic (EAL), which is motivated by applications to complexity and optimal reduction. Following previous references on this topic, the variant of EAL type system we consider (denoted EAL ) is a variant without sharing and without polymorphism. Our algorithm improves over the ones already known in that it offers a...
متن کاملA Graph Coloring Algorithm for Large Scheduling Problems*
A ne w graph coloring algorit hm is prese nt ed and compared to a wide variety of known algorit hms. The algorithm is shown to exhibit O(n 2) time be havior for most s parse graphs and thus is found to be parti cularl y well suited for use wi th large-scale sc heduling problems. In addition, a procedure for ge nerating large random test graphs with known chromatic number is present ed and is us...
متن کاملRole of EAL-containing proteins in multicellular behavior of Salmonella enterica serovar Typhimurium.
GGDEF and EAL domain proteins are involved in turnover of the novel secondary messenger cyclic di(3'-->5')-guanylic acid (c-di-GMP) in many bacteria. The rdar morphotype, a multicellular behavior of Salmonella enterica serovar Typhimurium characterized by the expression of the extracellular matrix components cellulose and curli fimbriae is controlled by c-di-GMP. In this work the roles of the E...
متن کاملAdaptively Resizing Populations: Algorithm, Analysis, and First Results
Abs tract . Deciding on an appropriate population size for a given genet ic algor it hm (GA) applicat ion can oft en be crit ical to the success of the algorit hm . Too small, and t he GA can fall vict im to sampling erro r , affect ing the efficacy of it s search . Too large, and t he GA wastes computational resour ces. Although advice exists for sizing GA popula tions, much of this adv ice in...
متن کاملEvaluating Search Methods Analytically
A unified approach to analyzing search algorithms is presented. Each algorithm is characterized by the types of random problems that it can solve rapidly. The results are displayed in a way that clearly indicabes the strengths and weaknesses of each algorithm. Many interesting problems can, at present, best be solved by search methods [7]. In the worst case, searching requires exponent ial time...
متن کامل