منابع مشابه
Search on a Line by Byzantine Robots
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. The robots can move with maximum speed 1 and can communicate in wireless mode among themselves. However, among the n robots, there are f robots that exhibit byzantine faults. A faulty robot can fail to report the ta...
متن کاملRendezvous on a Line by Location-Aware Robots Despite the Presence of Byzantine Faults
A set of mobile robots is placed at points of an infinite line. The robots are equipped with GPS devices and they may communicate their positions on the line to a central authority. The collection contains an unknown subset of “spies”, i.e., byzantine robots, which are indistinguishable from the non-faulty ones. The set of the non-faulty robots need to rendezvous in the shortest possible time i...
متن کاملCertified Impossibility Results for Byzantine-tolerant Mobile Robots Certified Impossibility Results for Byzantine-tolerant Mobile Robots
We propose a framework to build formal developments for robot networks using the COQ proof assistant, to state and to prove formally various properties. We focus in this paper on impossibility proofs, as it is natural to take advantage of the COQ higher order calculus to reason about algorithms as abstract objects. We present in particular formal proofs of two impossibility results for converge...
متن کاملThe BG-simulation for Byzantine Mobile Robots
This paper investigates the task solvability of mobile robot systems subject to Byzantinefaults. We first consider the gathering problem, which requires all robots to meet in finite timeat a non-predefined location. It is known that the solvability of Byzantine gathering stronglydepends on a number of system attributes, such as synchrony, the number of Byzantine robots,schedulin...
متن کاملZMP Compensation by On-Line Trajectory Generation for Biped Robots
This paper proposes an adaptive trajectory generation strategy of using on-line ZMP information with an impedance control method. During walking, since the robot experiences various disturbances like pulling or pushing forces, the walking mechanism should have the robustness against those disturbances, and it requires an on-line adaptation ability. If sensed ZMP goes out of the preset ZMP bound...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Foundations of Computer Science
سال: 2021
ISSN: 0129-0541,1793-6373
DOI: 10.1142/s0129054121500209