Zobrazeno 1 - 10
of 16
pro vyhledávání: '"J. Frederico Carvalho"'
Publikováno v:
PeerJ Computer Science, Vol 4, p e153 (2018)
We describe the Coefficient-Flow algorithm for calculating the bounding chain of an $(n-1)$-boundary on an $n$-manifold-like simplicial complex $S$. We prove its correctness and show that it has a computational time complexity of O(|S(n−1)|) (where
Externí odkaz:
https://doaj.org/article/d26316aee9594836acf8f006c2ad9b24
Publikováno v:
The International Journal of Robotics Research
In this work we propose algorithms to explicitly construct a conservative estimate of the configuration spaces of rigid objects in 2D and 3D. Our approach is able to detect compact path components and narrow passages in configuration space which are
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fcea8d6bab0c00f9fc79b9959f06794c
http://arxiv.org/abs/2002.02715
http://arxiv.org/abs/2002.02715
Publikováno v:
Automatica. 78:123-134
Motivated by the development and deployment of large-scale dynamical systems, often comprised of geographically distributed smaller subsystems, we address the problem of verifying their controllability in a distributed manner. Specifically, we study
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a5d529b9fd5ce36dfcc6c2b2fdb88bac
https://doi.org/10.1016/j.automatica.2016.12.016
https://doi.org/10.1016/j.automatica.2016.12.016
Publikováno v:
Springer Proceedings in Advanced Robotics ISBN: 9783030286187
ISRR
ISRR
Caging restricts the mobility of an object without necessarily immobilizing it completely. The object is caged if it cannot move arbitrarily far from its initial position. Apart from its common applications to grasping and manipulation, caging can al
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::de654716ebe818ea2d7228a82b29545e
https://doi.org/10.1007/978-3-030-28619-4_43
https://doi.org/10.1007/978-3-030-28619-4_43
Publikováno v:
IROS
In order for robots to share their workspace with people, they need to reason about human motion efficiently. In this work we leverage large datasets of paths in order to infer local models that are able to perform long-term predictions of human moti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d8e914d1aa4c2473002e97c36f3a95bc
https://doi.org/10.1109/iros40897.2019.8968125
https://doi.org/10.1109/iros40897.2019.8968125
Publikováno v:
PeerJ Computer Science, Vol 4, p e153 (2018)
PeerJ Computer Science
PeerJ Computer Science
We describe the Coefficient-Flow algorithm for calculating the bounding chain of an $(n-1)$-boundary on an $n$-manifold-like simplicial complex $S$. We prove its correctness and show that it has a computational time complexity of O(|S(n−1)|) (where
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b082550038cfb086ac83a4a060e1fdc2
https://doi.org/10.7287/peerj.preprints.3151v1
https://doi.org/10.7287/peerj.preprints.3151v1
Publikováno v:
CDC
In this paper, for linear time-invariant plants, where a collection of possible inputs and outputs are known a priori, we address the problem of determining the communication between outputs and inputs, i.e., information patterns, such that desired c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::58b7a12d103e1837eba28da386a95659
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Conference
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Conference
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.