Agent-centered search
TL;DR: This article describes agent-centered search (also called real-time search or local search) and illustrates this planning paradigm with examples and discusses the design and properties of several agent- centered search methods, focusing on robot exploration and localization.
read more
Abstract: In this article, I describe agent-centered search (also called real-time search or local search) and illustrate this planning paradigm with examples. Agent-centered search methods interleave planning and plan execution and restrict planning to the part of the domain around the current state of the agent, for example, the current location of a mobile robot or the current board position of a game. These methods can execute actions in the presence of time constraints and often have a small sum of planning and execution cost, both because they trade off planning and execution cost and because they allow agents to gather information early in nondeterministic domains, which reduces the amount of planning they have to perform for unencountered situations. These advantages become important as more intelligent systems are interfaced with the world and have to operate autonomously in complex environments. Agent-centered search methods have been applied to a variety of domains, including traditional search, strips-type planning, moving-target search, planning with totally and partially observable Markov decision process models, reinforcement learning, constraint satisfaction, and robot navigation. I discuss the design and properties of several agent-centered search methods, focusing on robot exploration and localization.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Online planning algorithms for POMDPs
TL;DR: The objectives here are to survey the various existing online POMDP methods, analyze their properties and discuss their advantages and disadvantages; and to thoroughly evaluate these online approaches in different environments under various metrics.
Real-time randomized path planning for robot navigation
James R. Bruce,Manuela Veloso +1 more
- 10 Dec 2002
TL;DR: This work builds a path planning system based on RRTs that interleaves planning and execution, first evaluating it in simulation and then applying it to physical robots, and demonstrates that ERRT is significantly more efficient for replanning than a basic RRT planner.
•Journal Article
Real-time randomized path planning for robot navigation
James R. Bruce,Manuela Veloso +1 more
TL;DR: This work builds a path planning system based on RRTs that interleaves planning and execution, first evaluating it in simulation and then applying it to physical robots, and demonstrates that ERRT is significantly more efficient for replanning than a basic RRT planner.
368
Machine Learning Techniques Applied to Wireless Ad-Hoc Networks: Guide and Survey
Anna Förster
- 01 Dec 2007
TL;DR: This work is a survey on the usage of machine learning techniques in wireless sensor networks (WSNs) and mobile ad-hoc networks (MANETs) to classify and evaluate the most important existing and on-going research in the area and to provide a guide for researchers wanting to apply machineLearning techniques.
140
Comparing real-time and incremental heuristic search for real-time situated agents
Sven Koenig,Xiaoxun Sun +1 more
TL;DR: This article develops a competitive real-time heuristic search method that can outperform D* Lite under the right conditions, namely when there is time pressure or the user-supplied h-values are generally not misleading, and analyzes the properties of LSS-LRTA*, a version of Learning Real-Time A* that uses A* to determine its local search spaces and learns quickly.
References
•Book
Reinforcement Learning: An Introduction
Richard S. Sutton,Andrew G. Barto +1 more
- 01 Jan 1988
TL;DR: This book provides a clear and simple account of the key ideas and algorithms of reinforcement learning, which ranges from the history of the field's intellectual foundations to the most recent developments and applications.
•Book
Artificial Intelligence: A Modern Approach
Stuart Russell,Peter Norvig +1 more
- 01 Jan 2020
TL;DR: In this article, the authors present a comprehensive introduction to the theory and practice of artificial intelligence for modern applications, including game playing, planning and acting, and reinforcement learning with neural networks.
21.4K
Reinforcement learning: a survey
TL;DR: Central issues of reinforcement learning are discussed, including trading off exploration and exploitation, establishing the foundations of the field via Markov decision theory, learning from delayed reinforcement, constructing empirical models to accelerate learning, making use of generalization and hierarchy, and coping with hidden state.
Lecture Notes in Artificial Intelligence
P. Brezillon,P. Bouquet +1 more
- 01 Jan 1999
TL;DR: The topics in LNAI include automated reasoning, automated programming, algorithms, knowledge representation, agent-based systems, intelligent systems, expert systems, machine learning, natural-language processing, machine vision, robotics, search systems, knowledge discovery, data mining, and related programming languages.
7.5K
•Book
Parallel and Distributed Computation: Numerical Methods
Dimitri P. Bertsekas,John N. Tsitsiklis +1 more
- 01 Jan 1989
TL;DR: This work discusses parallel and distributed architectures, complexity measures, and communication and synchronization issues, and it presents both Jacobi and Gauss-Seidel iterations, which serve as algorithms of reference for many of the computational approaches addressed later.
7K