Using simulation and critical points to define states in continuous search spaces

Marc S. Atkin, Paul R Cohen

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

Abstract

Many artificial intelligence techniques rely on the notion of a `state' as an abstraction of the actual state of the world, and an `operator' as an abstraction of the actions that take you from one state to the next. Much of the art of problem solving depends on choosing the appropriate set of states and operators. However, in realistic, and therefore dynamic and continuous search spaces, finding the right level of abstraction can be difficult. If too many states are chosen, the search space becomes intractable; if too few are chosen, important interactions between operators might be missed, making the search results meaningless. We present the idea of simulating operators using critical points as a way of dynamically defining state boundaries; new states are generated as part of the process of applying operators. Critical point simulation allows the use of standard search and planning techniques in continuous domains, as well as the incorporation of multiple agents, dynamic environments, and non-atomic variable length actions into the search algorithm. We conclude with examples of implemented systems that show how critical points are used in practice.

Original languageEnglish (US)
Title of host publicationWinter Simulation Conference Proceedings
Pages464-470
Number of pages7
Volume1
StatePublished - 2000
Externally publishedYes
Event2000 Winter Simulation Conference Proceedings - Orlando, FL,USA
Duration: Dec 10 2000Dec 13 2000

Other

Other2000 Winter Simulation Conference Proceedings
CityOrlando, FL,USA
Period12/10/0012/13/00

Fingerprint

Search Space
Critical point
Operator
Artificial intelligence
Simulation
Planning
Dynamic Environment
Search Algorithm
Artificial Intelligence
Interaction
Abstraction

ASJC Scopus subject areas

  • Chemical Health and Safety
  • Software
  • Safety, Risk, Reliability and Quality
  • Applied Mathematics
  • Modeling and Simulation

Cite this

Atkin, M. S., & Cohen, P. R. (2000). Using simulation and critical points to define states in continuous search spaces. In Winter Simulation Conference Proceedings (Vol. 1, pp. 464-470)

Using simulation and critical points to define states in continuous search spaces. / Atkin, Marc S.; Cohen, Paul R.

Winter Simulation Conference Proceedings. Vol. 1 2000. p. 464-470.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Atkin, MS & Cohen, PR 2000, Using simulation and critical points to define states in continuous search spaces. in Winter Simulation Conference Proceedings. vol. 1, pp. 464-470, 2000 Winter Simulation Conference Proceedings, Orlando, FL,USA, 12/10/00.
Atkin MS, Cohen PR. Using simulation and critical points to define states in continuous search spaces. In Winter Simulation Conference Proceedings. Vol. 1. 2000. p. 464-470
Atkin, Marc S. ; Cohen, Paul R. / Using simulation and critical points to define states in continuous search spaces. Winter Simulation Conference Proceedings. Vol. 1 2000. pp. 464-470
@inproceedings{02c001ff2012419f80ebac638c23042a,
title = "Using simulation and critical points to define states in continuous search spaces",
abstract = "Many artificial intelligence techniques rely on the notion of a `state' as an abstraction of the actual state of the world, and an `operator' as an abstraction of the actions that take you from one state to the next. Much of the art of problem solving depends on choosing the appropriate set of states and operators. However, in realistic, and therefore dynamic and continuous search spaces, finding the right level of abstraction can be difficult. If too many states are chosen, the search space becomes intractable; if too few are chosen, important interactions between operators might be missed, making the search results meaningless. We present the idea of simulating operators using critical points as a way of dynamically defining state boundaries; new states are generated as part of the process of applying operators. Critical point simulation allows the use of standard search and planning techniques in continuous domains, as well as the incorporation of multiple agents, dynamic environments, and non-atomic variable length actions into the search algorithm. We conclude with examples of implemented systems that show how critical points are used in practice.",
author = "Atkin, {Marc S.} and Cohen, {Paul R}",
year = "2000",
language = "English (US)",
volume = "1",
pages = "464--470",
booktitle = "Winter Simulation Conference Proceedings",

}

TY - GEN

T1 - Using simulation and critical points to define states in continuous search spaces

AU - Atkin, Marc S.

AU - Cohen, Paul R

PY - 2000

Y1 - 2000

N2 - Many artificial intelligence techniques rely on the notion of a `state' as an abstraction of the actual state of the world, and an `operator' as an abstraction of the actions that take you from one state to the next. Much of the art of problem solving depends on choosing the appropriate set of states and operators. However, in realistic, and therefore dynamic and continuous search spaces, finding the right level of abstraction can be difficult. If too many states are chosen, the search space becomes intractable; if too few are chosen, important interactions between operators might be missed, making the search results meaningless. We present the idea of simulating operators using critical points as a way of dynamically defining state boundaries; new states are generated as part of the process of applying operators. Critical point simulation allows the use of standard search and planning techniques in continuous domains, as well as the incorporation of multiple agents, dynamic environments, and non-atomic variable length actions into the search algorithm. We conclude with examples of implemented systems that show how critical points are used in practice.

AB - Many artificial intelligence techniques rely on the notion of a `state' as an abstraction of the actual state of the world, and an `operator' as an abstraction of the actions that take you from one state to the next. Much of the art of problem solving depends on choosing the appropriate set of states and operators. However, in realistic, and therefore dynamic and continuous search spaces, finding the right level of abstraction can be difficult. If too many states are chosen, the search space becomes intractable; if too few are chosen, important interactions between operators might be missed, making the search results meaningless. We present the idea of simulating operators using critical points as a way of dynamically defining state boundaries; new states are generated as part of the process of applying operators. Critical point simulation allows the use of standard search and planning techniques in continuous domains, as well as the incorporation of multiple agents, dynamic environments, and non-atomic variable length actions into the search algorithm. We conclude with examples of implemented systems that show how critical points are used in practice.

UR - http://www.scopus.com/inward/record.url?scp=0034430052&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0034430052&partnerID=8YFLogxK

M3 - Conference contribution

VL - 1

SP - 464

EP - 470

BT - Winter Simulation Conference Proceedings

ER -