Open AccessProceedings Article
An analysis of time-dependent planning
Thomas Dean,Mark S. Boddy +1 more
- pp 49-54
Reads0
Chats0
TLDR
This paper presents a framework for exploring issues in time-dependent planning: planning in which the time available to respond to predicted events varies, and the decision making required to formulate effective responses is complex.Abstract:
This paper presents a framework for exploring issues in time-dependent planning: planning in which the time available to respond to predicted events varies, and the decision making required to formulate effective responses is complex. Our analysis of time-dependent planning suggests an approach based on a class of algorithms that we call anytime algorithms. Anytime algorithms can be interrupted at any point during computation to return a result whose utility is a function of computation time. We explore methods for solving time-dependent planning problems based on the properties of anytime algorithms.read more
Citations
More filters
BookDOI
Sequential Monte Carlo methods in practice
TL;DR: This book presents the first comprehensive treatment of Monte Carlo techniques, including convergence results and applications to tracking, guidance, automated target recognition, aircraft navigation, robot navigation, econometrics, financial modeling, neural networks, optimal control, optimal filtering, communications, reinforcement learning, signal enhancement, model averaging and selection.
Journal ArticleDOI
Robust Monte Carlo localization for mobile robots
TL;DR: A more robust algorithm is developed called MixtureMCL, which integrates two complimentary ways of generating samples in the estimation of Monte Carlo Localization algorithms, and is applied to mobile robots equipped with range finders.
Book
Multiagent Systems
TL;DR: This second edition has been completely revised, capturing the tremendous developments in multiagent systems since the first edition appeared in 1999.
Proceedings Article
Monte Carlo localization: efficient position estimation for mobile robots
TL;DR: Monte Carlo Localization is a version of Markov localization, a family of probabilistic approaches that have recently been applied with great practical success and yields improved accuracy while requiring an order of magnitude less computation when compared to previous approaches.
Journal ArticleDOI
Learning metric-topological maps for indoor mobile robot navigation
TL;DR: This paper describes an approach that integrates both paradigms: grid-based and topological, which gains advantages from both worlds: accuracy/consistency and efficiency.
References
More filters
Book ChapterDOI
Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
TL;DR: In this article, the authors survey the state of the art with respect to optimization and approximation algorithms and interpret these in terms of computational complexity theory, and indicate some problems for future research and include a selective bibliography.
Journal ArticleDOI
ISIS—a knowledge‐based system for factory scheduling
Mark S. Fox,Stephen F. Smith +1 more
TL;DR: This paper describes ISIS, a scheduling system capable of incorporating all relevant constraints in the construction of job shop schedules, and examines both the representation of constraints within ISIS, and the manner in which these constraints are used in conducting a constraint-directed search for an acceptable schedule.