On the design of minimal robots that can solve planning problems

DA Shell, JM O'Kane… - IEEE Transactions on …, 2021 - ieeexplore.ieee.org
This article examines the selection of a robot's actuation and sensing hardware to minimize
the cost of that design while ensuring that the robot is capable of carrying out a plan to …

Toward a language-theoretic foundation for planning and filtering

FZ Saberifar, S Ghasemlou, DA Shell… - … Journal of Robotics …, 2019 - journals.sagepub.com
We address problems underlying the algorithmic question of automating the co-design of
robot hardware in tandem with its apposite software. Specifically, we consider the impact …

Abstractions for computing all robotic sensors that suffice to solve a planning problem

Y Zhang, DA Shell - 2020 IEEE International Conference on …, 2020 - ieeexplore.ieee.org
Whether a robot can perform some specific task depends on several aspects, including the
robot's sensors and the plans it possesses. We are interested in search algorithms that treat …

On the relationship between bisimulation and combinatorial filter reduction

H Rahmani, JM O'Kane - 2018 IEEE International Conference …, 2018 - ieeexplore.ieee.org
Combinatorial filters are discrete structures for modeling and reasoning about robotic
systems. Such filters are of interest not only because of the potential for reduction of the …

Cover combinatorial filters and their minimization problem

Y Zhang, DA Shell - Algorithmic Foundations of Robotics XIV: Proceedings …, 2021 - Springer
Recent research has examined algorithms to minimize robots' resource footprints. The class
of combinatorial filters (discrete variants of widely-used probabilistic estimators) has been …

The hardness of minimizing design cost subject to planning problems

FZ Saberifar, JM O'Kane, DA Shell - … of Robotics XIII: Proceedings of the …, 2020 - Springer
Assuming one wants to design the most cost-effective robot for some task, how difficult is it to
choose the robot's actuators? This paper addresses that question in algorithmic terms …

A general class of combinatorial filters that can be minimized efficiently

Y Zhang, DA Shell - 2023 IEEE International Conference on …, 2023 - ieeexplore.ieee.org
State minimization of combinatorial filters is a fundamental problem that arises, for example,
in building cheap, resource-efficient robots. But exact minimization is known to be NP-hard …

Delineating boundaries of feasibility between robot designs

S Ghasemlou, JM O'Kane… - 2018 IEEE/RSJ …, 2018 - ieeexplore.ieee.org
Motivated by the need for tools to aid in the design of effective robots, we examine how to
determine the role that particular sensing and actuator resources play in enabling a robot to …

Sensing and Infrastructure Design for Robots: A Plan-Based Perspective

GA McFASSEL - 2023 - search.proquest.com
Currently there do not exist general-purpose robots, and the procedures by which robots are
designed are often ad hoc. Additionally, designers must deal with considerations including …

Accelerating combinatorial filter reduction through constraints

Y Zhang, H Rahmani, DA Shell… - 2021 IEEE International …, 2021 - ieeexplore.ieee.org
Reduction of combinatorial filters involves compressing state representations that robots
use. Such optimization arises in automating the construction of minimalist robots. But exact …