Zobrazeno 1 - 10
of 23
pro vyhledávání: '"Tansel Uras"'
Autor:
Tansel Uras, Sven Koenig
Publikováno v:
Proceedings of the International Symposium on Combinatorial Search. 9:106-114
Subgoal graphs can be constructed on top of graphs during a preprocessing phase to speed-up shortest path queries. They have an undominated query-time/memory trade-off in the Grid-Based Path Planning Competitions. While grids are useful for path plan
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bd2cd13fab80a580516e4ba8276a7348
https://doi.org/10.1609/socs.v9i1.18446
https://doi.org/10.1609/socs.v9i1.18446
Publikováno v:
Proceedings of the International Symposium on Combinatorial Search. 6:2-8
Multi-agent path-finding (MAPF) is important for applications such as the kind of warehousing done by Kiva systems. Solving the problem optimally is NP-hard, yet finding low-cost solutions is important. Bounded-suboptimal MAPF algorithms, such as enh
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5c413f7821e401da38e5eeced5c8155c
https://doi.org/10.1609/socs.v6i1.18363
https://doi.org/10.1609/socs.v6i1.18363
Autor:
Tansel Uras, Sven Koenig
Publikováno v:
Proceedings of the International Symposium on Combinatorial Search. 6:206-210
We compare five any-angle path-planning algorithms, Theta*, Block A*, Field D*, ANYA, and Any-Angle Subgoal Graphs in terms of solution quality and runtime. Any-angle path-planning is a fairly new research area, and no direct comparison exists betwee
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f07dfd1a7b6593b0a83de49208a95a86
https://doi.org/10.1609/socs.v6i1.18382
https://doi.org/10.1609/socs.v6i1.18382
Publikováno v:
Proceedings of the International Symposium on Combinatorial Search. 10:44-51
Multi-Agent Motion Planning (MAMP) is the task of finding conflict-free kinodynamically feasible plans for agents from start to goal states. While MAMP is of significant practical importance, existing solvers are either incomplete, inefficient or rel
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::46ea2e39a4e59f7722d65e402e16ed54
https://doi.org/10.1609/socs.v10i1.18501
https://doi.org/10.1609/socs.v10i1.18501
Autor:
Tansel Uras, Sven Koenig
Publikováno v:
Proceedings of the International Symposium on Combinatorial Search. 8:100-108
Search using subgoal graphs is a recent preprocessing-based path-planning algorithm that can find shortest paths on 8-neighbor grids several orders of magnitude faster than A*, while requiring little preprocessing time and memory overhead. In this pa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1802df12cb30c23b0da6e72baef4033c
https://doi.org/10.1609/socs.v8i1.18434
https://doi.org/10.1609/socs.v8i1.18434
Publikováno v:
Proceedings of the International Symposium on Combinatorial Search. 11:106-110
Paths found on grid graphs are often unrealistic looking in the continuous environment that the grid graph represents and often need to be smoothed after a search. The well-known algorithm for path smoothing is greedy in nature and does not necessari
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::132dfb82ebc0bae5f1729090a5959757
https://doi.org/10.1609/socs.v11i1.18541
https://doi.org/10.1609/socs.v11i1.18541
Autor:
Nathan Sturtevant, Jason Traish, James Tulip, Tansel Uras, Sven Koenig, Ben Strasser, Adi Botea, Daniel Harabor, Steve Rabin
Publikováno v:
Proceedings of the International Symposium on Combinatorial Search. 6:241-250
The Grid-Based Path Planning Competition has just completed its third iteration. The entriesused in the competition have improved significantly during this time, changing the view ofthe state of the art of grid-based pathfinding. Furthermore, the ent
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4cb5e749b9ffd392b537f275a43a62dd
https://doi.org/10.1609/socs.v6i1.18364
https://doi.org/10.1609/socs.v6i1.18364
Publikováno v:
Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment. 11:108-114
Video-game designers often tessellate continuous 2-dimensional terrain into a grid of blocked and unblocked square cells. The three main ways to calculate short paths on such a grid are to determine truly shortest paths, shortest vertex paths and sho
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2cc6f8878df8a23867754b102d2abf10
https://doi.org/10.1609/aiide.v11i1.12808
https://doi.org/10.1609/aiide.v11i1.12808
Publikováno v:
Proceedings of the International Symposium on Combinatorial Search. 3:159-161
Incremental search algorithms, such as D* Lite, reuse information from previous searches to speed up the current search and can thus solve sequences of similar search problems faster than Repeated A*, which performs repeated A* searches. In this posi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d05ee54bdb1b27daa859307050aeb7b5
https://doi.org/10.1609/socs.v3i1.18268
https://doi.org/10.1609/socs.v3i1.18268
Teaching Undergraduate Artificial Intelligence Classes: An Experiment with an Attendance Requirement
Publikováno v:
AAAI
We report on an experiment that we performed when we taught the undergraduate artificial intelligence class at the University of Southern California. We taught it – under very similar conditions – once with and once without an attendance requirem
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ebc1755a56e3000f59ff00a7abea0cca
https://doi.org/10.1609/aaai.v34i09.7060
https://doi.org/10.1609/aaai.v34i09.7060