Linear Search by a Pair of Distinct-Speed Robots
نویسندگان
چکیده
منابع مشابه
Linear Search by a Pair of Distinct-Speed Robots
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. 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. The target is discovered at the moment when either robot arrives at its positi...
متن کامل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...
متن کاملDelta Robots – Robots for High Speed Manipulation
Delta roboti Mechanical systems that allow a rigid body (called endeffector) to move with respect to a fixed base play a very important role in numerous applications. A rigid body in space can move in various ways, in translation or rotary motion. These are called its degrees of freedom (DOF). The position and the orientation of the end-effector (called its pose) can be described by its general...
متن کاملa genre analytic study of research papers written by bilingual writers and their beliefs: a case of persian-english writers
تحقیق حاضر گزارشی است از تحلیل بخش مقدمه دو دسته از مقالات که عبارتند از: 11 مقاله از دو نویسنده دوزبانه فارسی زبان, که شامل مقدمه 4 مقاله به زبان انگلیسی و چاپ شده در مجلات بین المللی, مقدمه 3 مقاله به زبان انگلیسی و 4 مقاله به زبان فارسی چاپ شده در مجلات داخلی می شود؛ و 12 مقاله از محققان خارجی که در مجله applied linguistics به چاپ رسیده است. مبنای تئوری این تحلیل ها نظریه سوئلز (1990) یا هما...
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2018
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-018-0447-0