About: Goal-Based Adversarial Search - Searching Game Trees in Complex Domains using Goal-based Heuristic

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Goal-Based Adversarial Search - Searching Game Trees in Complex Domains using Goal-based Heuristic Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
Description	Prezentujeme originální přístup k redukci rozsahu prohledávání herního stromu s použitím znalostí reprezentovaných jako cíle jednotlivých hráčů na vyšší úrovni abstrakce. Algoritmus je založený na algoritmu maxn upraveném pro současné tahy, který prohledává jen větve herního stromu konzistentní se směřováním k některým z cílů. Algoritmus byt testován na simulaci realistického scénáře modelovaného jako rozsáhlá asymetrická hra. Získané experimentální výsledky ukazují schopnosti heuristiky založené na cílech, která umožňuje zredukovat prohledávaný prostor na zvládnutelnou velkost a i v komplexních doménách si zachovat vysokou kvalitu nalezených řešení. (cs) 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 goal-based heuristic to reduce the search space to a manageable level even in complex domains while maintaining the high quality of resulting strategies. 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 goal-based heuristic to reduce the search space to a manageable level even in complex domains while maintaining the high quality of resulting strategies. (en)
Title	Goal-Based Adversarial Search - Searching Game Trees in Complex Domains using Goal-based Heuristic Goal-Based Adversarial Search - Searching Game Trees in Complex Domains using Goal-based Heuristic (en) Prohledávaní herních stromů v složitých doménách s použitím heuristiky založené na cílech (cs)
skos:prefLabel	Goal-Based Adversarial Search - Searching Game Trees in Complex Domains using Goal-based Heuristic Goal-Based Adversarial Search - Searching Game Trees in Complex Domains using Goal-based Heuristic (en) Prohledávaní herních stromů v složitých doménách s použitím heuristiky založené na cílech (cs)
skos:notation	RIV/68407700:21230/09:03152773!RIV09-MSM-21230___
http://linked.open...avai/riv/aktivita	Z
http://linked.open...avai/riv/aktivity	Z(MSM6840770038)
http://linked.open...vai/riv/dodaniDat	2009
http://linked.open...aciTvurceVysledku	Lisý, Viliam Bošanský, Branislav Pěchouček, Michal Jakob, Michal
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	České vysoké učení technické v Praze / Fakulta elektrotechnická
http://linked.open...dnocenehoVysledku	316547
http://linked.open...ai/riv/idVysledku	RIV/68407700:21230/09:03152773
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	game tree searc, adversarial planning; goal, background knowledge; complex domain (en)
http://linked.open.../riv/klicoveSlovo	adversarial planning game tree searc background knowledge goal complex domain
http://linked.open...ontrolniKodProRIV	[8D5ABAE6EE18]
http://linked.open...v/mistoKonaniAkce	Porto
http://linked.open...i/riv/mistoVydani	Setúbal
http://linked.open...i/riv/nazevZdroje	First International Conference on Agents and Artificial Intelligence, Proceedings
http://linked.open...in/vavai/riv/obor	JC
http://linked.open...ichTvurcuVysledku	4 (xsd:int)
http://linked.open...cetTvurcuVysledku	4 (xsd:int)
http://linked.open...UplatneniVysledku	2009
http://linked.open...iv/tvurceVysledku	Bošanský, Branislav Jakob, Michal Lisý, Viliam Pěchouček, Michal
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open.../riv/zahajeniAkce	2009-01-19 (xsd:date)
http://linked.open...n/vavai/riv/zamer	Decision Making and Control for Manufacturing III
number of pages	8 (xsd:int)
http://purl.org/ne...btex#hasPublisher	Institute for Systems and Technologies of Information, Control and Communication
https://schema.org/isbn	978-989-8111-66-1
http://localhost/t...ganizacniJednotka	21230
is http://linked.open...avai/riv/vysledek of	Goal-Based Adversarial Search - Searching Game Trees in Complex Domains using Goal-based Heuristic Goal-Based Adversarial Search - Searching Game Trees in Complex Domains using Goal-based Heuristic Goal-Based Adversarial Search - Searching Game Trees in Complex Domains using Goal-based Heuristic Goal-Based Adversarial Search - Searching Game Trees in Complex Domains using Goal-based Heuristic

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software