Skip to content
arXiv Robotics — research abstracts· Tsukasa Ninomiya, Shota Naito, Naoki Kitamura, Yuichi Sudo, Koichi Wada·· 1 days agoEditorial score68

A Minimum Exact Disjunctive Basis for Two-Robot Solvability Profiles

A Minimum Exact Disjunctive Basis for Two-Robot Solvability Profiles

Summary

This research characterizes the solvability profiles of tasks for two autonomous mobile robots in the plane under variable disorientation, chirality, and rigid movements. It proves that every upset is realizable and constructs a minimum exact disjunctive basis of thirteen concrete tasks, which can represent all 54 possible profiles through their canonical disjunctive representations.

Source: arXiv Robotics — research abstracts · Read original article ↗

Loading article text…

Source:arXiv Robotics — research abstracts · arxiv.org

Timezone · UTC

Article dates follow your selected timezone. Briefing editions use Hong Kong time (UTC+8).