Journal ArticleDOI
Temporal constraint networks
TLDR
It is shown that the STP, which subsumes the major part of Vilain and Kautz's point algebra, can be solved in polynomial time and the applicability of path consistency algorithms as preprocessing of temporal problems is studied, to demonstrate their termination and bound their complexities.About:
This article is published in Artificial Intelligence.The article was published on 1991-05-01. It has received 1989 citations till now. The article focuses on the topics: Constraint satisfaction problem & Constraint satisfaction.read more
Citations
More filters
Proceedings Article
MAPGEN : mixed initiative planning and scheduling for the Mars '03 MER mission
Mitchell Ai-Chang,John L. Bresina,Len Charest,Ari K. Jonsson,Jennifer Hsu,Bob Kanefsky,Pierre F. Maldague,Paul Morris,Kanna Rajan,Jeffrey Yglesias +9 more
TL;DR: The mixed-initiative activity planner GENerator (MAPGEN) as discussed by the authors is an activity planning tool for the Mars Exploration Rovers Mars '03 mission that combines two exiting systems, APGEN the Activity Planning tool from the Jet Propulsion Laboratory and the Europs Planning/Scheduling system from NASA Ames Research Center.
Proceedings Article
Improving the temporal flexibility of position constrained metric temporal plans
TL;DR: This paper develops a general CSP encoding for partializing position-constrained temporal plans, that can be optimized under an objective function dealing with a variety of temporal flexibility criteria, such as makespan.
Proceedings Article
Integrated motion planning and coordination for industrial vehicles
TL;DR: This work presents an approach to obtain sets of alternative execution patterns (called trajectory envelopes) which provide guarantees to accommodate on-line externally imposed temporal and spatial requirements and to adhere to them even in the presence of contingencies.
Book ChapterDOI
A Generic Neural Network Approach For Constraint Satisfaction Problems
Edward Tsang,C. J. Wang +1 more
TL;DR: A neural network approach for solving CSPs which aims at providing prompt responses, which lends itself to the VLSI implementation of parallel processing architectures and the limited number of cycles required by GENET to find the solutions for the tested problems gives hope for solving large C SPs in a fraction of the time required by conventional methods.
Proceedings ArticleDOI
Representation and constrained planning of manipulation strategies in the context of Programming by Demonstration
TL;DR: A partially symbolic representation of manipulation strategies based on a temporal satisfaction problem with domain constraints is developed by using constrained motion planning and a geometric constraint representation, generalization to different robot systems and new environments is achieved.
References
More filters
Book
The Design and Analysis of Computer Algorithms
Alfred V. Aho,John E. Hopcroft +1 more
TL;DR: This text introduces the basic data structures and programming techniques often used in efficient algorithms, and covers use of lists, push-down stacks, queues, trees, and graphs.
Journal Article
Maintaining knowledge about temporal intervals
TL;DR: An interval-based temporal logic is introduced, together with a computationally effective reasoning algorithm based on constraint propagation, which is notable in offering a delicate balance between space and time.
Journal ArticleDOI
Maintaining knowledge about temporal intervals
TL;DR: In this paper, an interval-based temporal logic is introduced, together with a computationally effective reasoning algorithm based on constraint propagation, which is notable in offering a delicate balance between time and space.
Journal ArticleDOI
Combinatorial optimization: algorithms and complexity
TL;DR: This clearly written, mathematically rigorous text includes a novel algorithmic exposition of the simplex method and also discusses the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NP-complete problems; approximation algorithms, local search heuristics for NPcomplete problems, more.
Journal ArticleDOI
Consistency in Networks of Relations
TL;DR: The primary aim is to provide an accessible, unified framework, within which to present the algorithms including a new path consistency algorithm, to discuss their relationships and the may applications, both realized and potential of network consistency algorithms.