Modeling Temporally Dynamic Environments for Persistent Autonomous Agents

AAAI Conferences

This paper explores how an autonomous agent can model dynamic environments and use that knowledge to improve its behavior. This capability is of particular importance for persistent agents, or long-term autonomy. Inspiration is drawn from circadian rhythms in nature, which drive periodic behavior in many organisms. In our approach, the chemical oscillators from nature are replaced with methods from time series analysis designed for forecasting complex season patterns. This model is incorporated into a behavior-based architecture as an advanced-percept, providing future estimates of the environment rather than current measurements. A simulated application of a janitor robot working in an environment with heavy pedestrian traffic was created as a testbed. Experimental data used real world pedestrian traffic counts and showed an agent using online forecasting of future traffic outperformed both a reactive, sensor-based, strategy and a strategy with a deterministic schedule.


A Survey of Research in Distributed, Continual Planning

AI Magazine

Planning and executing the resulting plans in a dynamic environment implies a continual approach in which planning and execution are interleaved, uncertainty in the current and projected world state is recognized and handled appropriately, and replanning can be performed when the situation changes or planned actions fail. Furthermore, complex planning and execution problems may require multiple computational agents and human planners to collaborate on a solution. In this article, we describe a new paradigm for planning in complex, dynamic environments, which we term distributed, continual planning (DCP). We give a historical overview of research leading to the current state of the art in DCP and describe research in distributed and continual planning.



WS97-08-012.pdf

AAAI Conferences

Abstraction and aggregation are useful for increasing speed of inference in and easing knowledge acquisition of belief networks. This paper presents previous research on belief network abstraction and aggregation, discusses its hmitations, and outlines directions for future research. Introduction Abstraction and aggregation have been used in several areas in artificial intelligence, including in planning, model-based reasoning, and reasoning under uncertainty. For reasoning under uncertainty, the framework of decision theory and in particular the notion of influence diagram (or decision diagram) has proven fruitful. An influence diagram is essentially a graph, where nodes are chance nodes, decision (or action) nodes, utility (or Value) nodes.


Combining a Probabilistic Sampling Technique and Simple Heuristics to solve the Dynamic Path Planning Problem

arXiv.org Artificial Intelligence

Probabilistic sampling methods have become very popular to solve single-shot path planning problems. Rapidly-exploring Random Trees (RRTs) in particular have been shown to be very efficient in solving high dimensional problems. Even though several RRT variants have been proposed to tackle the dynamic replanning problem, these methods only perform well in environments with infrequent changes. This paper addresses the dynamic path planning problem by combining simple techniques in a multi-stage probabilistic algorithm. This algorithm uses RRTs as an initial solution, informed local search to fix unfeasible paths and a simple greedy optimizer. The algorithm is capable of recognizing when the local search is stuck, and subsequently restart the RRT. We show that this combination of simple techniques provides better responses to a highly dynamic environment than the dynamic RRT variants.