About: Anytime Algorithms for Multi-agent Visibility-based Pursuit-evasion Games

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

About: Anytime Algorithms for Multi-agent Visibility-based Pursuit-evasion Games 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
rdfs:seeAlso	http://dl.acm.org/citation.cfm?id=2343896.2343974
Description	We investigate algorithms for playing multi-agent visibility-based pursuit-evasion games. A team of pursuers attempts to maintain visibility contact with an evader who actively avoids tracking. We aim for applicability of the algorithms in real-world scenarios; hence, we impose hard constraints on the run-time of the algorithms and we evaluate them in a simulation model based on a real-world urban area. We compare Monte-Carlo tree search (MCTS) and iterative deepening minimax algorithms running on the information-set tree of the imperfect-information game. The experimental results demonstrate that both methods create comparable good strategies for the pursuer, while the later performs better in creating the evader's strategy. We investigate algorithms for playing multi-agent visibility-based pursuit-evasion games. A team of pursuers attempts to maintain visibility contact with an evader who actively avoids tracking. We aim for applicability of the algorithms in real-world scenarios; hence, we impose hard constraints on the run-time of the algorithms and we evaluate them in a simulation model based on a real-world urban area. We compare Monte-Carlo tree search (MCTS) and iterative deepening minimax algorithms running on the information-set tree of the imperfect-information game. The experimental results demonstrate that both methods create comparable good strategies for the pursuer, while the later performs better in creating the evader's strategy. (en)
Title	Anytime Algorithms for Multi-agent Visibility-based Pursuit-evasion Games Anytime Algorithms for Multi-agent Visibility-based Pursuit-evasion Games (en)
skos:prefLabel	Anytime Algorithms for Multi-agent Visibility-based Pursuit-evasion Games Anytime Algorithms for Multi-agent Visibility-based Pursuit-evasion Games (en)
skos:notation	RIV/68407700:21230/12:00200109!RIV13-MSM-21230___
http://linked.open...avai/riv/aktivita	P S
http://linked.open...avai/riv/aktivity	P(GAP202/12/2054), S
http://linked.open...vai/riv/dodaniDat	2013
http://linked.open...aciTvurceVysledku	Pěchouček, Michal Bošanský, Branislav Lisý, Viliam
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	123050
http://linked.open...ai/riv/idVysledku	RIV/68407700:21230/12:00200109
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	Pursuit-evasion game; Monte-Carlo tree search; Information-set search; Anytime algorithm (en)
http://linked.open.../riv/klicoveSlovo	Anytime algorithm Information-set search Monte-Carlo tree search Pursuit-evasion game
http://linked.open...ontrolniKodProRIV	[55DE72E30D2E]
http://linked.open...v/mistoKonaniAkce	Valencia
http://linked.open...i/riv/mistoVydani	County of Richland
http://linked.open...i/riv/nazevZdroje	Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems
http://linked.open...in/vavai/riv/obor	IN
http://linked.open...ichTvurcuVysledku	3 (xsd:int)
http://linked.open...cetTvurcuVysledku	3 (xsd:int)
http://linked.open...vavai/riv/projekt	Bezpečnostní hry v extenzivní formě
http://linked.open...UplatneniVysledku	2012
http://linked.open...iv/tvurceVysledku	Bošanský, Branislav Lisý, Viliam Pěchouček, Michal
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open.../riv/zahajeniAkce	2012-06-04 (xsd:date)
number of pages	2 (xsd:int)
http://purl.org/ne...btex#hasPublisher	IFAAMAS
https://schema.org/isbn	978-0-9817381-3-0
http://localhost/t...ganizacniJednotka	21230

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, 100 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software