Article

The nonlinear nature of plans

Author:

IJCAI'75: Proceedings of the 4th international joint conference on Artificial intelligence - Volume 1

Pages 206 - 214

Published: 03 September 1975 Publication History

Abstract

We usually think of plans as linear sequences of actions. This is because plans are usually executed one step at a time. But plans themselves are not constrained by limitations of linearity. This paper describes a new information structure, called the procedural net, that represents a plan as a partial ordering of actions with respec to time. By avoiding premature commitments to a particular order for achieving subgoals, a problem-solving system using this representation can deal easily and directly with problems that are otherwise very difficult to solve.

References

[1]

Sussman, G. J., "A Computational Model of skill Acquisition," Tech, Note AI TR-297, Artificial Intelligence Laboratory, MIT, Cambridge, Ma., August 1973

Google Scholar

[2]

Fikes, R. E., and Nilsson, N. J., "STRIPS: A New Approach to the Application of Theorem Proving t o Problem Solving, "Artificial Intelligence, Vol. 2, pp. 189-208, 1971

Crossref

Google Scholar

[3]

Sacerdoti, E. D., "Planning in a Hierarchy of Abstraction Spaces," Artificial Intelligence, Vol.5, No. 2, pp. 115-135, 1974

Crossref

Google Scholar

[4]

Tate, A., "INTERPLAN: A Plan Generation System which can deal with Interactions between Goals," Memorandum MIP-R-109, Machine Intelligence Research Unit, University of Edinburgh, December 1974

Google Scholar

[5]

Warren, D.H.D., "WARPLAN: A System for Generating Plans," Memo No. 76, Department of Computational Logic, University of Edinburgh, June 1974

Google Scholar

[6]

Hart, P. E., "Progress on a Computer-Based Consultant," Tech. Note 99, Artificial Intelligence Center, SRI, Menlo Park, CA., January 1975

Google Scholar

[7]

Sacerdoti, E. D., "A Structure for Plans and Behavior," forthcoming Ph.D. thesis, Stanford University

Crossref

Google Scholar

[8]

Reboh, R., and Sacerdoti, E. D., "A Preliminary QLISP Manual," Tech. Note 81, Artificial Intelligence Center, SRI, Menlo Park, Ca., August 1973

Google Scholar

[9]

Sussman, G. J., "The Virtuous Nature of Bugs," Proc. AISB Summer Conference, July 1974

Google Scholar

[10]

Manna, Z. and Waldinger, R., "Knowledge and Reasoning In Program Synthesis," Tech. Note 98, Artificial Intelligence Center, SRI, Menlo Park, Ca., November 1974

Crossref

Google Scholar

Cited By

View all

Yang WPeng YYin QSun LJohansson BJain S(2018)History-based single belief state generation for partially observable real-time strategy gamesProceedings of the 2018 Winter Simulation Conference10.5555/3320516.3320617(763-773)Online publication date: 9-Dec-2018
https://dl.acm.org/doi/10.5555/3320516.3320617
Kapadia MFrey SShoulson ASumner RGross MSolenthaler BTeschner MKavan LWojtan C(2016)CANVASProceedings of the ACM SIGGRAPH/Eurographics Symposium on Computer Animation10.5555/2982818.2982846(199-209)Online publication date: 11-Jul-2016
https://dl.acm.org/doi/10.5555/2982818.2982846
Mudrova LLacerda BHawes N(2016)Partial order temporal plan merging for mobile robot tasksProceedings of the Twenty-second European Conference on Artificial Intelligence10.3233/978-1-61499-672-9-1537(1537-1545)Online publication date: 29-Aug-2016
https://dl.acm.org/doi/10.3233/978-1-61499-672-9-1537
Show More Cited By

Recommendations

On computing conformant plans using classical planners: a generate-and-complete approach
ICAPS'12: Proceedings of the Twenty-Second International Conference on International Conference on Automated Planning and Scheduling

The paper illustrates a novel approach to conformant planning using classical planners. The approach relies on two core ideas developed to deal with incomplete information in the initial situation: the use of a classical planner to solve non-classical ...
Conformant plans and beyond: Principles and complexity

Conformant planning is used to refer to planning for unobservable problems whose solutions, like classical planning, are linear sequences of operators called linear plans. The term 'conformant' is automatically associated with both the unobservable ...
Arguing about plans: plan representation and reasoning for mixed-initiative planning
AIPS'94: Proceedings of the Second International Conference on Artificial Intelligence Planning Systems

We consider the problem of representing plans for mixed-initiative planning, where several participants cooperate to develop plans. We claim that in such an environment, a crucial task is plan communication: the ability to suggest aspects of a plan, ...

Comments

Information & Contributors

Information

Published In

IJCAI'75: Proceedings of the 4th international joint conference on Artificial intelligence - Volume 1

September 1975

944 pages

Publisher

Morgan Kaufmann Publishers Inc.

San Francisco, CA, United States

Publication History

Published: 03 September 1975

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

22
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 10 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Yang WPeng YYin QSun LJohansson BJain S(2018)History-based single belief state generation for partially observable real-time strategy gamesProceedings of the 2018 Winter Simulation Conference10.5555/3320516.3320617(763-773)Online publication date: 9-Dec-2018
https://dl.acm.org/doi/10.5555/3320516.3320617
Kapadia MFrey SShoulson ASumner RGross MSolenthaler BTeschner MKavan LWojtan C(2016)CANVASProceedings of the ACM SIGGRAPH/Eurographics Symposium on Computer Animation10.5555/2982818.2982846(199-209)Online publication date: 11-Jul-2016
https://dl.acm.org/doi/10.5555/2982818.2982846
Mudrova LLacerda BHawes N(2016)Partial order temporal plan merging for mobile robot tasksProceedings of the Twenty-second European Conference on Artificial Intelligence10.3233/978-1-61499-672-9-1537(1537-1545)Online publication date: 29-Aug-2016
https://dl.acm.org/doi/10.3233/978-1-61499-672-9-1537
Say BCire ABeck J(2016)Mathematical programming models for optimizing partial-order plan flexibilityProceedings of the Twenty-second European Conference on Artificial Intelligence10.3233/978-1-61499-672-9-1044(1044-1052)Online publication date: 29-Aug-2016
https://dl.acm.org/doi/10.3233/978-1-61499-672-9-1044
Elogeel AKolobov AAlden MTeredesai AWeiss GYolum PBordini RElkind E(2015)Selecting Robust Strategies in RTS Games via Concurrent Plan AugmentationProceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems10.5555/2772879.2772902(155-162)Online publication date: 4-May-2015
https://dl.acm.org/doi/10.5555/2772879.2772902
Dominguez CIchimura YKapadia M(2015)Automated interactive narrative synthesis using dramatic theoryProceedings of the 8th ACM SIGGRAPH Conference on Motion in Games10.1145/2822013.2822028(103-112)Online publication date: 16-Nov-2015
https://dl.acm.org/doi/10.1145/2822013.2822028
Kapadia MFalk JZünd FMarti MSumner RGross MKeyser JSander PSubr KWei L(2015)Computer-assisted authoring of interactive narrativesProceedings of the 19th Symposium on Interactive 3D Graphics and Games10.1145/2699276.2699279(85-92)Online publication date: 27-Feb-2015
https://dl.acm.org/doi/10.1145/2699276.2699279
Georgievski IAiello M(2015)HTN planningArtificial Intelligence10.1016/j.artint.2015.02.002222:C(124-156)Online publication date: 1-May-2015
https://dl.acm.org/doi/10.1016/j.artint.2015.02.002
Santi ARicci AJamali NRicci AWeiss GYonezawa A(2013)A task framework on top of a concurrent OOP language rooted on agent-oriented abstractionsProceedings of the 2013 workshop on Programming based on actors, agents, and decentralized control10.1145/2541329.2541345(139-144)Online publication date: 27-Oct-2013
https://dl.acm.org/doi/10.1145/2541329.2541345
Kvarnström J(2011)Planning for loosely coupled agents using partial order forward-chainingProceedings of the Twenty-First International Conference on International Conference on Automated Planning and Scheduling10.5555/3038485.3038504(138-145)Online publication date: 11-Jun-2011
https://dl.acm.org/doi/10.5555/3038485.3038504
Show More Cited By

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Recommendations

On computing conformant plans using classical planners: a generate-and-complete approach

Conformant plans and beyond: Principles and complexity

Arguing about plans: plan representation and reasoning for mixed-initiative planning

Comments

Published In

Sponsors

Publisher

Publication History

Qualifiers

Other Metrics

Article Metrics

Other Metrics

Cited By

Login options

Full Access

Abstract

References

Cited By

Recommendations

On computing conformant plans using classical planners: a generate-and-complete approach

Conformant plans and beyond: Principles and complexity

Arguing about plans: plan representation and reasoning for mixed-initiative planning

Comments

Information

Published In

Sponsors

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations