Zobrazeno 1 - 10
of 34
pro vyhledávání: '"Olsen Trevor"'
This paper studies a multi-robot visibility-based pursuit-evasion problem in which a group of pursuer robots are tasked with detecting an evader within a two dimensional polygonal environment. The primary contribution is a novel formulation of the pu
Externí odkaz:
http://arxiv.org/abs/2109.08715
This paper addresses the visibility-based pursuit-evasion problem where a team of pursuer robots operating in a two-dimensional polygonal space seek to establish visibility of an arbitrarily fast evader. This is a computationally challenging task for
Externí odkaz:
http://arxiv.org/abs/2104.04109
Given a two-dimensional polygonal space, the multi-robot visibility-based pursuit-evasion problem tasks several pursuer robots with the goal of establishing visibility with an arbitrarily fast evader. The best known complete algorithm for this proble
Externí odkaz:
http://arxiv.org/abs/2102.09013
The Wiener index of a connected graph is the sum of the distances between all unordered pairs of vertices. We provide formulae for the minimum Wiener index of simple triangulations and quadrangulations with connectivity at least $c$, and provide the
Externí odkaz:
http://arxiv.org/abs/2003.03873
Let $ G $ be a connected graph. If $\bar{\sigma}(v)$ denotes the arithmetic mean of the distances from $v$ to all other vertices of $G$, then the proximity, $\pi(G)$, of $G$ is defined as the smallest value of $\bar{\sigma}(v)$ over all vertices $v$
Externí odkaz:
http://arxiv.org/abs/2001.09012
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, vol. 23 no. 1, Graph Theory (March 8, 2021) dmtcs:6473
Let $G$ be a a connected graph. The Wiener index of a connected graph is the sum of the distances between all unordered pairs of vertices. We provide asymptotic formulae for the maximum Wiener index of simple triangulations and quadrangulations with
Externí odkaz:
http://arxiv.org/abs/1905.06753
Publikováno v:
In Discrete Applied Mathematics 15 December 2022 322:295-310
Publikováno v:
In Journal of Pediatric Urology October 2013 9(5):613-616
Publikováno v:
2022 International Conference on Robotics and Automation (ICRA).
This paper studies a multi-robot visibility-based pursuit-evasion problem in which a group of pursuer robots are tasked with detecting an evader within a two dimensional polygonal environment. The primary contribution is a novel formulation of the pu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::01729e18874bad9022d6bcd246a5b282
https://doi.org/10.1109/icra46639.2022.9812333
https://doi.org/10.1109/icra46639.2022.9812333
Publikováno v:
Electronic Journal of Graph Theory and Applications. 10:425
Let $ G $ be a connected graph. If $\bar{\sigma}(v)$ denotes the arithmetic mean of the distances from $v$ to all other vertices of $G$, then the proximity, $\pi(G)$, of $G$ is defined as the smallest value of $\bar{\sigma}(v)$ over all vertices $v$
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::844fa4398b1a085943941eccec4b83df
https://doi.org/10.5614/ejgta.2022.10.2.7
https://doi.org/10.5614/ejgta.2022.10.2.7