1996/04/01 by Joshua Grass, Shlomo Zilberstein · 54 citations
Computer Science · #AI-based Problem Solving and Planning #Robotic Path Planning Algorithms #Constraint Satisfaction and Optimization #Computer science #Lisp #Process (computing) #Algorithm #Development (topology) #Software engineering #Programming language
paper · doi:10.1145/242587.242592
published in ACM SIGART Bulletin 7(2), 20-27 (Association for Computing Machinery)
openalex publication_date 1996/04/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/15
Anytime algorithms are playing an increasingly important role in the construction of effective reasoning and planning systems. Early work on anytime algorithms concentrated on the construction of applications in such areas as medical diagnosis and mobile robot navigation. In this paper we describe a programming environment to support the development of such applications as well as larger applications in which several anytime algorithms are used. The widespread use of anytime algorithms depends largely on the availability of such programming tools for algorithm construction, performance measurement, composition of anytime algorithms, and monitoring of their execution. We present a prototype system that meets these needs. Created in lisp, this library of functions, graphical tools and monitoring modules will accelerate and simplify the process of programming with anytime algorithms.