loading
Papers Papers/2022 Papers Papers/2022

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Viliam Lisý ; Branislav Bošanský ; Michal Jakob and Michal Pěchouček

Affiliation: Czech Technical University in Prague, Czech Republic

Keyword(s): Game tree search, Adversarial planning, Goals, Background knowledge, Complex domain.

Related Ontology Subjects/Areas/Topics: Agents ; Artificial Intelligence ; Formal Methods ; Game Playing ; Informatics in Control, Automation and Robotics ; Intelligent Control Systems and Optimization ; Planning and Scheduling ; Simulation and Modeling ; State Space Search ; Symbolic Systems ; Task Planning and Execution

Abstract: We present a novel approach to reducing adversarial search space by using background knowledge represented in the form of higher-level goals that players tend to pursue in the game. The algorithm is derived from a simultaneous-move modification of the maxn algorithm by only searching the branches of the game tree that are consistent with pursuing player’s goals. The algorithm has been tested on a real-world-based scenario modelled as a large-scale asymmetric game. The experimental results obtained indicate the ability of the goalbased heuristic to reduce the search space to a manageable level even in complex domains while maintaining the high quality of resulting strategies.

CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 18.218.184.214

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Lisý, V.; Bošanský, B.; Jakob, M. and Pěchouček, M. (2009). GOAL-BASED ADVERSARIAL SEARCH - Searching Game Trees in Complex Domains using Goal-based Heuristic. In Proceedings of the International Conference on Agents and Artificial Intelligence - ICAART; ISBN 978-989-8111-66-1; ISSN 2184-433X, SciTePress, pages 53-60. DOI: 10.5220/0001659900530060

@conference{icaart09,
author={Viliam Lisý. and Branislav Bošanský. and Michal Jakob. and Michal Pěchouček.},
title={GOAL-BASED ADVERSARIAL SEARCH - Searching Game Trees in Complex Domains using Goal-based Heuristic},
booktitle={Proceedings of the International Conference on Agents and Artificial Intelligence - ICAART},
year={2009},
pages={53-60},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001659900530060},
isbn={978-989-8111-66-1},
issn={2184-433X},
}

TY - CONF

JO - Proceedings of the International Conference on Agents and Artificial Intelligence - ICAART
TI - GOAL-BASED ADVERSARIAL SEARCH - Searching Game Trees in Complex Domains using Goal-based Heuristic
SN - 978-989-8111-66-1
IS - 2184-433X
AU - Lisý, V.
AU - Bošanský, B.
AU - Jakob, M.
AU - Pěchouček, M.
PY - 2009
SP - 53
EP - 60
DO - 10.5220/0001659900530060
PB - SciTePress

- Science and Technology Publications, Lda.
RESOURCES

Proceedings

Papers

Authors

Ontology

CONTACTS

Science and Technology Publications, Lda
Avenida de S. Francisco Xavier, Lote 7 Cv. C,
2900-616 Setúbal, Portugal.

Phone: +351 265 520 185 (National fixed network call)
Fax: +351 265 520 186
Email: info@scitepress.org

EXTERNAL LINKS

PRIMORIS

INSTICC

SCITEVENTS

CROSSREF

PROCEEDINGS SUBMITTED FOR INDEXATION BY:

dblp

Ei Compendex

SCOPUS

Semantic Scholar

Google Scholar

Microsoft Academic