Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 2 of 2
Full-Text Articles in Physical Sciences and Mathematics
On-Line Planning And Scheduling: An Application To Controlling Modular Printers, Wheeler Ruml, Minh Binh Do, Rong Zhou, Markus P. J. Fromherz
On-Line Planning And Scheduling: An Application To Controlling Modular Printers, Wheeler Ruml, Minh Binh Do, Rong Zhou, Markus P. J. Fromherz
Computer Science
We present a case study of artificial intelligence techniques applied to the control of production printing equipment. Like many other real-world applications, this complex domain requires high-speed autonomous decision-making and robust continual operation. To our knowledge, this work represents the first successful industrial application of embedded domain-independent temporal planning. Our system handles execution failures and multi-objective preferences. At its heart is an on-line algorithm that combines techniques from state-space planning and partial-order scheduling. We suggest that this general architecture may prove useful in other applications as more intelligent systems operate in continual, on-line settings. Our system has been used to …
Best-First Heuristic Search For Multicore Machines, Ethan Burns, Sofia N. Lemons, Wheeler Ruml, Rong Zhou
Best-First Heuristic Search For Multicore Machines, Ethan Burns, Sofia N. Lemons, Wheeler Ruml, Rong Zhou
Computer Science
To harness modern multicore processors, it is imperative to develop parallel versions of fundamental algorithms. In this paper, we compare different approaches to parallel best-first search in a shared-memory setting. We present a new method, PBNF, that uses abstraction to partition the state space and to detect duplicate states without requiring frequent locking. PBNF allows speculative expansions when necessary to keep threads busy. We identify and fix potential livelock conditions in our approach, proving its correctness using temporal logic. Our approach is general, allowing it to extend easily to suboptimal and anytime heuristic search. In an empirical comparison on STRIPS …