![](https://dblp.uni-trier.de./img/logo.320x120.png)
![search dblp search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
default search action
Robotics and Autonomous Systems, Volume 122
Volume 122, December 2019
- Enrico Simetti, Giuseppe Casalino, Francesco Wanderlingh
, Michele Aicardi:
A task priority approach to cooperative mobile manipulation: Theory and experiments. - Bruno Lacerda
, Pedro U. Lima
:
Petri net based multi-robot task coordination from temporal logic specifications. - Abdurrahman Yilmaz
, Hakan Temeltas
:
Self-adaptive Monte Carlo method for indoor localization of smart AGVs using LIDAR data. - Tanja Katharina Kaiser
, Heiko Hamann:
Engineered self-organization for resilient robot self-assembly with minimal surprise. - Edson B. F. Filho
, Luciano C. A. Pimenta
:
Abstraction based approach for segregation in heterogeneous robotic swarms. - Dong Jin Hyun, KiHyeon Bae, KyuJung Kim, Seungkyu Nam, Dong-Hyun Lee:
A light-weight passive upper arm assistive exoskeleton based on multi-linkage spring-energy dissipation mechanism for overhead tasks. - Satoshi Ito
, Kosuke Niwa, Shoya Sugiura, Ryosuke Morita
:
An autonomous mobile robot with passive wheels propelled by a single motor. - John Klingner, Nisar R. Ahmed
, Nikolaus Correll:
Fault-tolerant Covariance Intersection for localizing robot swarms. - Maxim Vochten
, Tinne De Laet
, Joris De Schutter
:
Generalizing demonstrated motion trajectories using coordinate-free shape descriptors. - Yelin Fu
, Ming Li
, Hao Luo, George Q. Huang
:
Industrial robot selection using stochastic multicriteria acceptability analysis for group decision making.
![](https://dblp.uni-trier.de./img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.