Results 1 - 10 of 18,641

On the Complexity of Blocks-World Planning

by Naresh Gupta, Dana S. Nau - Artificial Intelligence , 1992
"... In this paper, we show that in the best-known version of the blocks world (and several related versions), planning is difficult, in the sense that finding an optimal plan is NP-hard. However, the NP-hardness is not due to deleted-condition interactions, but instead due to a situation which we call a ..."
Abstract - Cited by 92 (15 self) - Add to MetaCart
In this paper, we show that in the best-known version of the blocks world (and several related versions), planning is difficult, in the sense that finding an optimal plan is NP-hard. However, the NP-hardness is not due to deleted-condition interactions, but instead due to a situation which we call

Complexity Results for Blocks-World Planning

by Naresh Gupta, Dana S. Nau - In Proceedings of AAAI-91 , 1991
"... Although blocks-world planning is well-known, its complexity has not previously been analyzed, and different planning researchers have expressed conflicting opinions about its difficulty. In this paper, we present the following results: 1. Finding optimal plans in a well-known formulation of the blo ..."
Abstract - Cited by 41 (8 self) - Add to MetaCart
Although blocks-world planning is well-known, its complexity has not previously been analyzed, and different planning researchers have expressed conflicting opinions about its difficulty. In this paper, we present the following results: 1. Finding optimal plans in a well-known formulation

Integrated architectures for learning, planning, and reacting based on approximating dynamic programming

by Richard S. Sutton - Proceedings of the SevenLh International Conference on Machine Learning , 1990
"... gutton~gte.com Dyna is an AI architecture that integrates learning, planning, and reactive execution. Learning methods are used in Dyna both for compiling planning results and for updating a model of the effects of the agent's actions on the world. Planning is incremental and can use the probab ..."
Abstract - Cited by 563 (22 self) - Add to MetaCart
the probabilistic and ofttimes incorrect world models generated by learning processes. Execution is fully reactive in the sense that no planning intervenes between perception and action. Dyna relies on machine learning methods for learning from examples--these are among the basic building blocks making up

The unbearable automaticity of being

by John A. Bargh, Tanya L. Chartrand - AMERICAN PSYCHOLOGIST , 1999
"... What was noted by E. J. hanger (1978) remains true today: that much of contemporary psychological research is based on the assumption that people are consciously and systematically processing incoming information in order to construe and interpret their world and to plan and engage in courses of act ..."
Abstract - Cited by 604 (17 self) - Add to MetaCart
What was noted by E. J. hanger (1978) remains true today: that much of contemporary psychological research is based on the assumption that people are consciously and systematically processing incoming information in order to construe and interpret their world and to plan and engage in courses

Towards flexible teamwork

by Milind Tambe - JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH , 1997
"... Many AI researchers are today striving to build agent teams for complex, dynamic multi-agent domains, with intended applications in arenas such as education, training, entertainment, information integration, and collective robotics. Unfortunately, uncertainties in these complex, dynamic domains obst ..."
Abstract - Cited by 570 (59 self) - Add to MetaCart
and communication is key in addressing such uncertainties. Simply tting individual agents with precomputed coordination plans will not do, for their in flexibility can cause severe failures in teamwork, and their domain-specificity hinders reusability. Our central hypothesis is that the key to such flexibility

Real-Time Systems

by Fan Liu, Ajit Narayanan, Quan Bai , 2000
"... Collision avoidance is an important topic in multi-robot systems. Existing multi-robot pathfinding approaches ignore sideswipe collisions among robots (i.e., only consider the collision which two agents try to occupy the same node during the same time-step) [1, 3, 4], and allow diagonal move between ..."
Abstract - Cited by 602 (11 self) - Add to MetaCart
between two adjacent nodes (e.g., Figure 1(b)). However, in many real world applications, sideswipe collisions may also block robots ’ movements or cause deadlocks. For example, as shown in Figure 1, if the size of two robots is as big as the grid size they occupied, collisions will happen not only

Artificial Intelligence, 56(2-3):223–254, August 1992. On the Complexity of Blocks-World Planning ∗

by Naresh Gupta, Dana S. Nau
"... In this paper, we show that in the best-known version of the blocks world (and several related versions), planning is difficult, in the sense that finding an optimal plan is NP-hard. However, the NP-hardness is not due to deleted-condition interactions, but instead due to a situation which we call a ..."
Abstract - Add to MetaCart
In this paper, we show that in the best-known version of the blocks world (and several related versions), planning is difficult, in the sense that finding an optimal plan is NP-hard. However, the NP-hardness is not due to deleted-condition interactions, but instead due to a situation which we call

Autoplan: A Self-Processing Network Model for an Extended Blocks World Planning Environment

by C. Lynne D'autrechy, James A. Reggia, Frank Mcfadden
"... Self-processing network models (neural/connectionist models, marker-passing/message-passing networks, etc.) are currently undergoing intense investigation for a variety of information pro-cessing applications. These models are potentially very powerful in that they support a large amount of explicit ..."
Abstract - Add to MetaCart
on hierarchical plan generation, execution and revision through local operations in an "extended blocks world " environment. This scenario involves many challenging features that would be encountered in a real planning and control environment: multiple simultaneous goals, parallel as well

From Data Mining to Knowledge Discovery in Databases.

by Usama Fayyad , Gregory Piatetsky-Shapiro , Padhraic Smyth - AI Magazine, , 1996
"... ■ Data mining and knowledge discovery in databases have been attracting a significant amount of research, industry, and media attention of late. What is all the excitement about? This article provides an overview of this emerging field, clarifying how data mining and knowledge discovery in database ..."
Abstract - Cited by 538 (0 self) - Add to MetaCart
in databases are related both to each other and to related fields, such as machine learning, statistics, and databases. The article mentions particular real-world applications, specific data-mining techniques, challenges involved in real-world applications of knowledge discovery, and current and future

National debt in a neoclassical growth model.'

by Peter A Diamond - American Economic Review,
"... This paper contains a model designed to serve two purposes, to examine long-run competitive equilibrium in a growth model and then to explore the effects on this equilibrium of government debt. Samuelson [8] has examined the determination of interest rates in a singlecommodity world without durable ..."
Abstract - Cited by 698 (0 self) - Add to MetaCart
This paper contains a model designed to serve two purposes, to examine long-run competitive equilibrium in a growth model and then to explore the effects on this equilibrium of government debt. Samuelson [8] has examined the determination of interest rates in a singlecommodity world without
Results 1 - 10 of 18,641