Unified definition of heuristics for classical planning (2024)

Abstract

In many types of planning algorithms distance heuristics play an important role. Most of the earlier works restrict to STRIPS operators, and their application to a more general language with disjunctivity and conditional effects first requires an exponential size reduction to STRIPS operators. I present direct formalizations of a number of distance heuristics for a general operator description language in a uniform way, avoiding the exponentiality inherent in earlier reductive approaches. The formalizations use formulae to represent the conditions under which operators have given effects. The exponentiality shows up in satisfiability tests with these formulae, but would appear to be a minor issue because of the small size of the formulae.

Original languageEnglish
Title of host publicationECAI 2006
Subtitle of host publication17th European Conference on Artificial Intelligence August 29 - September 1, 2006, Riva del Garda, Italy
EditorsGerhard Brewka, Silvia Coradeschi, Anna Perini, Paolo Traverso
PublisherIOS Press BV
Pages600-604
Number of pages5
ISBN (Print)9781586036423
Publication statusPublished - 2006
Externally publishedYes

Publication series

NameFrontiers in Artificial Intelligence and Applications
Volume141
ISSN (Print)0922-6389
ISSN (Electronic)1879-8314

Other files and links

Cite this

  • APA
  • Author
  • BIBTEX
  • Harvard
  • Standard
  • RIS
  • Vancouver

Rintanen, J. (2006). Unified definition of heuristics for classical planning. In G. Brewka, S. Coradeschi, A. Perini, & P. Traverso (Eds.), ECAI 2006: 17th European Conference on Artificial Intelligence August 29 - September 1, 2006, Riva del Garda, Italy (pp. 600-604). (Frontiers in Artificial Intelligence and Applications; Vol. 141). IOS Press BV.

Rintanen, Jussi. / Unified definition of heuristics for classical planning. ECAI 2006: 17th European Conference on Artificial Intelligence August 29 - September 1, 2006, Riva del Garda, Italy. editor / Gerhard Brewka ; Silvia Coradeschi ; Anna Perini ; Paolo Traverso. IOS Press BV, 2006. pp. 600-604 (Frontiers in Artificial Intelligence and Applications).

@inbook{a63808b819c44186b8b83591622d310d,

title = "Unified definition of heuristics for classical planning",

abstract = "In many types of planning algorithms distance heuristics play an important role. Most of the earlier works restrict to STRIPS operators, and their application to a more general language with disjunctivity and conditional effects first requires an exponential size reduction to STRIPS operators. I present direct formalizations of a number of distance heuristics for a general operator description language in a uniform way, avoiding the exponentiality inherent in earlier reductive approaches. The formalizations use formulae to represent the conditions under which operators have given effects. The exponentiality shows up in satisfiability tests with these formulae, but would appear to be a minor issue because of the small size of the formulae.",

author = "Jussi Rintanen",

year = "2006",

language = "English",

isbn = "9781586036423",

series = "Frontiers in Artificial Intelligence and Applications",

publisher = "IOS Press BV",

pages = "600--604",

editor = "Gerhard Brewka and Silvia Coradeschi and Anna Perini and Paolo Traverso",

booktitle = "ECAI 2006",

address = "Netherlands",

}

Rintanen, J 2006, Unified definition of heuristics for classical planning. in G Brewka, S Coradeschi, A Perini & P Traverso (eds), ECAI 2006: 17th European Conference on Artificial Intelligence August 29 - September 1, 2006, Riva del Garda, Italy. Frontiers in Artificial Intelligence and Applications, vol. 141, IOS Press BV, pp. 600-604.

Unified definition of heuristics for classical planning. / Rintanen, Jussi.
ECAI 2006: 17th European Conference on Artificial Intelligence August 29 - September 1, 2006, Riva del Garda, Italy. ed. / Gerhard Brewka; Silvia Coradeschi; Anna Perini; Paolo Traverso. IOS Press BV, 2006. p. 600-604 (Frontiers in Artificial Intelligence and Applications; Vol. 141).

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

TY - CHAP

T1 - Unified definition of heuristics for classical planning

AU - Rintanen, Jussi

PY - 2006

Y1 - 2006

N2 - In many types of planning algorithms distance heuristics play an important role. Most of the earlier works restrict to STRIPS operators, and their application to a more general language with disjunctivity and conditional effects first requires an exponential size reduction to STRIPS operators. I present direct formalizations of a number of distance heuristics for a general operator description language in a uniform way, avoiding the exponentiality inherent in earlier reductive approaches. The formalizations use formulae to represent the conditions under which operators have given effects. The exponentiality shows up in satisfiability tests with these formulae, but would appear to be a minor issue because of the small size of the formulae.

AB - In many types of planning algorithms distance heuristics play an important role. Most of the earlier works restrict to STRIPS operators, and their application to a more general language with disjunctivity and conditional effects first requires an exponential size reduction to STRIPS operators. I present direct formalizations of a number of distance heuristics for a general operator description language in a uniform way, avoiding the exponentiality inherent in earlier reductive approaches. The formalizations use formulae to represent the conditions under which operators have given effects. The exponentiality shows up in satisfiability tests with these formulae, but would appear to be a minor issue because of the small size of the formulae.

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

M3 - Chapter

SN - 9781586036423

T3 - Frontiers in Artificial Intelligence and Applications

SP - 600

EP - 604

BT - ECAI 2006

A2 - Brewka, Gerhard

A2 - Coradeschi, Silvia

A2 - Perini, Anna

A2 - Traverso, Paolo

PB - IOS Press BV

ER -

Rintanen J. Unified definition of heuristics for classical planning. In Brewka G, Coradeschi S, Perini A, Traverso P, editors, ECAI 2006: 17th European Conference on Artificial Intelligence August 29 - September 1, 2006, Riva del Garda, Italy. IOS Press BV. 2006. p. 600-604. (Frontiers in Artificial Intelligence and Applications).

Unified definition of heuristics for classical planning (2024)

FAQs

What is heuristic in simple words? ›

Heuristics are mental shortcuts for solving problems in a quick way that delivers a result that is sufficient enough to be useful given time constraints. Investors and financial professionals use a heuristic approach to speed up analysis and investment decisions.

What are heuristics in creative problem-solving? ›

Heuristics, or "rules of thumb," are problem-solving methods that are based on practical experience and knowledge. They allow you to use a "quick fix" to solve a minor problem or to narrow down options. They're also a great starting point for brainstorming or exploring new ideas.

What do you mean by classical planning? ›

In classical planning, we aren't constrained to symbols that only take on true or false values, as we were in propositional logic. Instead, we introduce objects that can represent things in our environment. We let predicates, also called propositions, be true or false functions over the objects.

What is heuristic function with an example? ›

What is a heuristic function to give an example? A heuristic function estimates the approximate cost of solving a task. Determining the shortest driving distance to a particular location can be one example.

What best describes a heuristic? ›

Heuristics are mental shortcuts that allow people to solve problems and make judgments quickly and efficiently. These rule-of-thumb strategies shorten decision-making time and allow people to function without constantly stopping to think about their next course of action.

What is a good example of a heuristic? ›

Explanation. When you see a person with their hood up in a dark alley and you decide to subtly walk past a bit faster, your brain has probably used a heuristic to evaluate the situation instead of a full thought-out deliberation process.

What are the three major types of planning? ›

Three major types of plans can help managers achieve their organization's goals: strategic, tactical, and operational. Operational plans lead to the achievement of tactical plans, which in turn lead to the attainment of strategic plans.

What is heuristic planning in AI? ›

Heuristic methods in AI are based on cognitive science principles that revolve around 'how humans think'. Moreover, heuristic algorithms in AI enable systems to produce approximate solutions rather than exact ones.

What is PDDL in classical planning in AI? ›

The Planning Domain Definition Language (PDDL) is an attempt to standardize Artificial Intelligence (AI) planning languages. It was first developed by Drew McDermott and his colleagues in 1998 mainly to make the 1998/2000 International Planning Competition (IPC) possible, and then evolved with each competition.

What are heuristics in real life? ›

In everyday life, you might call heuristics rules of thumb, useful tricks, and habits, educated guesses, or just plain old common sense. Thinking in heuristics vs deliberate decision-making.

What is an example of a heuristic that you use in your everyday life? ›

Availability Heuristic: Heuristics which involve making decisions based on ease of availability in your mind. For example: Waiting for your flight at the airport, and thinking about airplane accidents, wondering if you should take a car instead.

What is heuristic technique? ›

A heuristic is a technique that is used to solve a problem faster than the classic methods. These techniques are used to find the approximate solution of a problem when classical methods do not. Heuristics are said to be the problem-solving techniques that result in practical and quick solutions.

What is another word for heuristic? ›

heuristic (adjective as in inquiring) Strong matches. examining interested interrogative probing prying questioning searching. Weak matches. analytical catechistic doubtful fact-finding inquisitive investigative investigatory nosy outward-looking quizzical Socratic speculative studious.

What is the literal meaning of heuristic? ›

See MODERN HEURISTIC. Heuristic, as an adjective, means “serving to discover.”

What is a heuristic method in simple words? ›

A heuristic method of teaching is an instructional approach that emphasizes the use of problem-solving and discovery-based learning as well as experience-based learning to facilitate student learning. Heuristic basically means any method or process that helps in problem-solving, self learning, and discovery.

What could be a possible simple explanation of a heuristic? ›

Heuristics are mental shortcuts that can facilitate problem-solving and probability judgments. These strategies are generalizations, or rules-of-thumb, that reduce cognitive load. They can be effective for making immediate judgments, however, they often result in irrational or inaccurate conclusions.

Top Articles
Latest Posts
Article information

Author: Tyson Zemlak

Last Updated:

Views: 6416

Rating: 4.2 / 5 (43 voted)

Reviews: 90% of readers found this page helpful

Author information

Name: Tyson Zemlak

Birthday: 1992-03-17

Address: Apt. 662 96191 Quigley Dam, Kubview, MA 42013

Phone: +441678032891

Job: Community-Services Orchestrator

Hobby: Coffee roasting, Calligraphy, Metalworking, Fashion, Vehicle restoration, Shopping, Photography

Introduction: My name is Tyson Zemlak, I am a excited, light, sparkling, super, open, fair, magnificent person who loves writing and wants to share my knowledge and understanding with you.