About: Solving Abstract Cooperative Path-Finding in Densely Populated Environments

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

About: Solving Abstract Cooperative Path-Finding in Densely Populated Environments 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	The problem of cooperative path-finding is addressed in this work. A set of agents moving in a certain environment is given. Each agent need to reach a given goal location. The task is to find spatial temporal paths for agents such that they eventually reach their goals by following these paths without colliding with each other. An abstraction where the environment is modeled as an undirected graph is adopted - vertices represent locations and edges represent passable regions. Agents are modeled as elements placed in the vertices. Space occupancy by agents is represented by a constraint that at most one agent can be located in a vertex at a time. At least one vertex remains unoccupied to allow agents to move. An agent can move into unoccupied neighboring vertex or into a vertex being currently vacated in a certain case. Two novel scalable algorithms for solving cooperative path-finding in bi connected graphs are presented. They are both targeted on the case with environments densely populated by agents which is the case that has now yet been addressed fully in the literature. It has been shown theoretically and experimentally that presented algorithms outperform existent algorithms capable of solving the given class in terms of speed as well as in terms of quality of generated solutions. The problem of cooperative path-finding is addressed in this work. A set of agents moving in a certain environment is given. Each agent need to reach a given goal location. The task is to find spatial temporal paths for agents such that they eventually reach their goals by following these paths without colliding with each other. An abstraction where the environment is modeled as an undirected graph is adopted - vertices represent locations and edges represent passable regions. Agents are modeled as elements placed in the vertices. Space occupancy by agents is represented by a constraint that at most one agent can be located in a vertex at a time. At least one vertex remains unoccupied to allow agents to move. An agent can move into unoccupied neighboring vertex or into a vertex being currently vacated in a certain case. Two novel scalable algorithms for solving cooperative path-finding in bi connected graphs are presented. They are both targeted on the case with environments densely populated by agents which is the case that has now yet been addressed fully in the literature. It has been shown theoretically and experimentally that presented algorithms outperform existent algorithms capable of solving the given class in terms of speed as well as in terms of quality of generated solutions. (en)
Title	Solving Abstract Cooperative Path-Finding in Densely Populated Environments Solving Abstract Cooperative Path-Finding in Densely Populated Environments (en)
skos:prefLabel	Solving Abstract Cooperative Path-Finding in Densely Populated Environments Solving Abstract Cooperative Path-Finding in Densely Populated Environments (en)
skos:notation	RIV/00216208:11320/14:10126392!RIV15-MSM-11320___
http://linked.open...avai/riv/aktivita	I P
http://linked.open...avai/riv/aktivity	I, P(GAP103/10/1287), P(GP201/09/P318)
http://linked.open...iv/cisloPeriodika	30 (2)
http://linked.open...vai/riv/dodaniDat	2015
http://linked.open...aciTvurceVysledku	Surynek, Pavel
http://linked.open.../riv/druhVysledku	J - Článek v odborném periodiku
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	Univerzita Karlova v Praze / Matematicko-fyzikální fakulta
http://linked.open...dnocenehoVysledku	45930
http://linked.open...ai/riv/idVysledku	RIV/00216208:11320/14:10126392
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	BIBOX; Path-Finding; Cooperative (en)
http://linked.open.../riv/klicoveSlovo	Cooperative Path-Finding BIBOX
http://linked.open...odStatuVydavatele	US - Spojené státy americké
http://linked.open...ontrolniKodProRIV	[3DDDCC2F16EF]
http://linked.open...i/riv/nazevZdroje	Computational Intelligence
http://linked.open...in/vavai/riv/obor	JD
http://linked.open...ichTvurcuVysledku	1 (xsd:int)
http://linked.open...cetTvurcuVysledku	1 (xsd:int)
http://linked.open...vavai/riv/projekt	Constraint programming and Boolean satisfiability for artificial intelligence PlanEx: Bridging Planning and Execution
http://linked.open...UplatneniVysledku	2014
http://linked.open...v/svazekPeriodika	2014
http://linked.open...iv/tvurceVysledku	Surynek, Pavel
http://linked.open...ain/vavai/riv/wos	000335401900009
issn	0824-7935
number of pages	50 (xsd:int)
http://bibframe.org/vocab/doi	10.1111/coin.12002
http://localhost/t...ganizacniJednotka	11320

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