A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
Linear Search by a Pair of Distinct-Speed Robots
2018
Algorithmica
Preserved Fulltext
In the case of communication by meeting, a robot learns about the target while sharing the same location with a robot possessing this knowledge. ...
In the wireless communication model, a message sent by one robot is instantly received by the other robot, regardless of their current positions on the line. ...
Acknowledgements We thank an anonymous referee for their careful reading and valuable comments, which induced an improvement to the presentation of the paper, as well as inspired a strengthening of some ...
doi:10.1007/s00453-018-0447-0
pmid:30872882
pmcid:PMC6390721
fatcat:sia6t222hncf3fgoavrj2wxvyi
Linear Search by a Pair of Distinct-Speed Robots
[chapter]
2016
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The robots need to find a stationary target placed at an unknown location on the line. The search is completed when both robots arrive at the target point. ...
Two mobile robots are initially placed at the same point on an infinite line. Each robot may move on the line in either direction not exceeding its maximal speed. ...
Acknowledgements We thank an anonymous referee for their careful reading and valuable comments, which induced an improvement to the presentation of the paper, as well as inspired a strengthening of some ...
doi:10.1007/978-3-319-48314-6_13
fatcat:jbol23tgljaqbms44nj4hf7zta
Search on a Line by Byzantine Robots
2021
International Journal of Foundations of Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We consider the problem of fault-tolerant parallel search on an infinite line by [Formula: see text] robots. Starting from the origin, the robots are required to find a target at an unknown location. ...
We aim to design algorithms that minimize the value of [Formula: see text], the time to find a target at a (unknown) distance [Formula: see text] from the origin by [Formula: see text] robots among which ...
Discussion In this paper, we considered a generalization of the well-known cow-path problem by having the search done in parallel with a group of n robots, with up to f of them being byzantine faulty. ...
doi:10.1142/s0129054121500209
fatcat:yenol6swwza57imaszsjj5h47u
Energy Consumption of Group Search on a Line
2019
International Colloquium on Automata, Languages and Programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
When the robots have bounded memory and can use only a constant number of fixed speeds, we generalize an algorithm described in [3, 15] to obtain a family of algorithms parametrized by pairs of b, c values ...
We investigate energy-time trade-offs in group search by two robots, where the energy loss experienced by a robot traveling a distance x at constant speed s is given by s 2 x, as motivated by energy consumption ...
An interested reader may consult [4] , where optimal group search algorithms for a pair of distinct maximal speed robots were proposed for both communication scenarios (F2F and wireless) and for any pair ...
doi:10.4230/lipics.icalp.2019.137
dblp:conf/icalp/CzyzowiczGKKKLN19
fatcat:ilcexam3tfarnj7nvy2fxpmqs4
Gaining environments through shape change
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Recent technological advances, ranging from stretchable circuits to highly deformable soft robots, have begun to make shape changing robots a possibility. ...
To begin addressing these questions, here we simulate, design, and build a soft robot that utilizes shape change to achieve locomotion over both a flat and inclined surface. ...
As the robot slid over a surface, it would typically exhibit an initial linear regime corresponding to pre-slip deformation of the feet, followed by slip and a second linear kinetic friction regime (Fig ...
arXiv:2008.06397v2
fatcat:y2rlylembbcipcb37q244gwayi
Search on a Line by Byzantine Robots
[article]
2016
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We consider the problem of fault-tolerant parallel search on an infinite line by n robots. Starting from the origin, the robots are required to find a target at an unknown location. ...
We aim to design algorithms that minimize the value of S_d(n,f), the time to find a target at a distance d from the origin by n robots among which f are faulty. ...
Group search using a pair of robots having distinct maximal speeds was studied in [6] , in which techniques producing optimal search time were designed. ...
arXiv:1611.08209v1
fatcat:2pcpmktygvbalnekbl4t5ntqsu
Search on a Line by Byzantine Robots
2016
International Symposium on Algorithms and Computation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We consider the problem of fault-tolerant parallel search on an infinite line by n robots. Starting from the origin, the robots are required to find a target at an unknown location. ...
We aim to design algorithms that minimize the value of S d (n, f ), the time to find a target at a distance d from the origin by n robots among which f are faulty. ...
Group search using a pair of robots having distinct maximal speeds was studied in [6] , in which techniques producing optimal search time were designed. ...
doi:10.4230/lipics.isaac.2016.27
dblp:conf/isaac/CzyzowiczGKKNOS16
fatcat:dqdigc5tqzgm5fua772sacthuy
Synthesized Trust Learning from Limited Human Feedback for Human-Load-Reduced Multi-Robot Deployments
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Other Versions
STL explores two aspects of human trust (trust level and trust preference), meanwhile accelerates the convergence speed by integrating active learning to reduce human workload. ...
To validate the effectiveness of the method, tasks "searching victims in the context of city rescue" were designed in an open-world simulation environment, and a user study with 10 volunteers was conducted ...
to support the task scenario, "Multiple robots search victims in the context of city rescue". ...
arXiv:2104.03151v2
fatcat:wadcn7smqrbapcxu62oimqbviq
The role of environmental and controller complexity in the distributed optimization of multi-robot obstacle avoidance
2014
2014 IEEE International Conference on Robotics and Automation (ICRA)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The ability to move in complex environments is a fundamental requirement for robots to be a part of our daily lives. ...
However, these two aspects may pose a considerable challenge on the optimization of robotic controllers. ...
For this purpose, we employed a multi-robot obstacle avoidance case study in which the complexity of controllers was varied by changing the number of sensors used as input, adding non-linear functions, ...
doi:10.1109/icra.2014.6906912
dblp:conf/icra/MarioNM14
fatcat:gakyd3swzba55bwdpw6qfvh2jy
Energy Consumption of Group Search on a Line
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We investigate energy-time trade-offs in group search by two robots, where the energy loss experienced by a robot traveling a distance x at constant speed s is given by s^2 x. ...
Specifically, we consider the problem of minimizing the total energy used by the robots, under the constraints that the search time is at most a multiple c of the distance d and the speed of the robots ...
Linear
search by a pair of distinct-speed robots. Algorithmica, 81(1):317–342, 2019.
12
[5] G. K. Batchelor. ...
arXiv:1904.09714v1
fatcat:ofe4chqfkngr7kpg5x3smawn24
Insights in evolutionary exploration of robot morphology spaces
2018
2018 IEEE Symposium Series on Computational Intelligence (SSCI)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In a recent study we have encountered an unexpected result regarding the evolutionary exploration of robot morphology spaces. ...
novelty and some behavioral criterion (speed of movement). ...
Each module type is represented by a distinct letter in the genotype and by a different color in the phenotype. ...
doi:10.1109/ssci.2018.8628662
dblp:conf/ssci/MirasGGE18
fatcat:6rmrqnxvxvbkfliwfqkqpg4dbe
Combining Multi-robot Exploration and Rendezvous
2011
2011 Canadian Conference on Computer and Robot Vision
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Problem definition: A pair of point robots must find one another to speed-up the exploration task in an unknown, GPS-denied, planar environment, where communication is only possible when robots are in ...
This graph is explored by traversing the nodes in depth-first order and using A* search algorithm for path-planning. ...
doi:10.1109/crv.2011.18
dblp:conf/crv/MeghjaniD11
fatcat:qoxca237jbeldlhq3z2yt7fv5q
Beachcombing on strips and islands
2019
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Different robots may have distinct maximal walking and searching speeds. A robot can change mode, speed, and direction of movement instantaneously. ...
A domain is said to be searched under a given schedule, if every point of the domain is visited by at least one robot in searching mode. ...
Part of this work was done while Jurek Czyzowicz was visiting the LaBRI as a guest professor of the University of Bordeaux. ...
doi:10.1016/j.tcs.2019.04.001
fatcat:diopssuivvhxhe2wssqugye6ha
Improving Localization Robustness in Monocular SLAM Using a High-Speed Camera
2008
Robotics: Science and Systems IV
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
To explain the benefits of using a high frame rate vision input in MonoSLAM framework, we performed repeatable experiments with a high-speed camera mounted onto a robotic arm. ...
In the robotics community localization and mapping of an unknown environment is a well-studied problem. ...
ACKNOWLEDGMENTS This research was supported by the European Union project XPERO IST-29427 and EPSRC Grant GR/T24685/01. ...
doi:10.15607/rss.2008.iv.024
dblp:conf/rss/GemeinerDV08
fatcat:wupmdyitufcr7cgjdcy3e2i2cy
Simple linear vision module for micro mobile robot applications
2008
2008 10th International Conference on Control, Automation, Robotics and Vision
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
A low-cost electronic device that transforms patterns of light into a digital signal recognized by a common electronic board to control micro mobile robots is presented. ...
The device has been tested with a micro mobile robot for recognizing and reading bar codes within a structured environment. ...
RELATED WORK The K213 vision turret is a sensor of linear vision developed by the K-team for its Kephera robot. ...
doi:10.1109/icarcv.2008.4795619
dblp:conf/icarcv/Ramirez-GarciaMV08
fatcat:h7xrzhp2ufd7jnumspyofvvd6q
« Previous
Showing results 1 — 15 out of 16,774 results