Zobrazeno 1 - 10
of 32
pro vyhledávání: '"Andrew Beveridge"'
Publikováno v:
Proceedings of the AAAI Conference on Artificial Intelligence. 26:2046-2052
We study the symmetric rendezvous search problem in which two robots that are unaware of each other’s locations try to meet as quickly as possible. In the symmetric version of this problem, the robots are required to execute the same strategy. Firs
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::63b1e198b6fa71a2cb3b2278d2cff1a2
https://doi.org/10.1609/aaai.v26i1.8385
https://doi.org/10.1609/aaai.v26i1.8385
Autor:
Ian Calaway, Andrew Beveridge
Publikováno v:
Order. 38:489-514
When making simultaneous decisions, our preference for the outcomes on one subset can depend on the outcomes on a disjoint subset. In referendum elections, this gives rise to the separability problem, where a voter must predict the outcome of one pro
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::16d4ba3240d0d8628be1fe1eeaaa3792
https://doi.org/10.1007/s11083-021-09553-8
https://doi.org/10.1007/s11083-021-09553-8
Publikováno v:
Artificial Intelligence. 273:19-36
In the rendezvous search problem, two or more robots at unknown locations should meet somewhere in the environment as quickly as possible. We study the symmetric rendezvous search problem in unknown planar environments with polygonal obstacles. In th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::302e2c1c73429d95a9b9b87be7a6cf1e
https://doi.org/10.1016/j.artint.2019.02.001
https://doi.org/10.1016/j.artint.2019.02.001
Publikováno v:
IEEE Robotics & Automation Magazine. 23:138-149
i»?A pursuitâevasion game takes place between two players. The pursuer is charged with capturing the evader while the evader tries to avoid getting caught. Many robotics applications such as search, tracking, and surveillance can be modeled as
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3c57df36c41e4de54a6f1d4e02a91eca
https://doi.org/10.1109/mra.2016.2540138
https://doi.org/10.1109/mra.2016.2540138
Publikováno v:
The Practitioner’s Handbook of Team Coaching ISBN: 9781351130554
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4d041540c45a04704c3b8b4fc50b2254
https://doi.org/10.4324/9781351130554-38
https://doi.org/10.4324/9781351130554-38
The order ideal $B_{n,2}$ of the Boolean lattice $B_n$ consists of all subsets of size at most $2$. Let $F_{n,2}$ denote the poset refinement of $B_{n,2}$ induced by the rules: $i < j$ implies $\{i \} \prec \{ j \}$ and $\{i,k \} \prec \{j,k\}$. We g
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::11bf189370f8544c8462aa1ac25c4db3
Autor:
Jie Shan, Andrew Beveridge
Publikováno v:
Math Horizons. 23:18-22
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::947141a038da00ac81f2d218ac4820cd
https://doi.org/10.4169/mathhorizons.23.4.18
https://doi.org/10.4169/mathhorizons.23.4.18
Autor:
Andrew Beveridge, Michael M. Chemers
In their 2009 anthology, Third Person: Authoring and Exploring Vast Narratives, editors Pat Harrigan and Noah Wardruip-Fruin discuss the explosive popularity of "vast narratives"; sweeping stories that combine multiple central characters and persiste
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9e7dea776a5ba3492a30b6f94ae75214
https://doi.org/10.4324/9781315114668-13
https://doi.org/10.4324/9781315114668-13
Autor:
Andrew Beveridge
Publikováno v:
Combinatorics, Probability and Computing. 25:362-379
The discrete Green's function (without boundary) $\mathbb{G}$ is a pseudo-inverse of the combinatorial Laplace operator of a graph $G=(V,E)$. We reveal the intimate connection between Green's function and the theory of exact stopping rules for random
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0139c93a5a33a33471d1a2dd1670c635
https://doi.org/10.1017/s0963548315000152
https://doi.org/10.1017/s0963548315000152
Autor:
Maxray Savage, Volkan Isler, Rosalie Carlson, Andrew Beveridge, Brendan P. W. Ames, Stephen Ragain, Claire Djang
Publikováno v:
International Journal of Computational Geometry & Applications. 25:77-100
We study pursuit-evasion in a polygonal environment with polygonal obstacles. In this turn based game, an evader $e$ is chased by pursuers $p_1, p_2, ..., p_{\ell}$. The players have full information about the environment and the location of the othe
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::24e25a6f18f92148e7c370a08c908d80
https://doi.org/10.1142/s0218195915500065
https://doi.org/10.1142/s0218195915500065