On the design of minimal robots that can solve planning problems
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 …
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
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 …
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
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 …
robot's sensors and the plans it possesses. We are interested in search algorithms that treat …
Cover combinatorial filters and their minimization problem
Recent research has examined algorithms to minimize robots' resource footprints. The class
of combinatorial filters (discrete variants of widely-used probabilistic estimators) has been …
of combinatorial filters (discrete variants of widely-used probabilistic estimators) has been …
On the relationship between bisimulation and combinatorial filter reduction
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 …
systems. Such filters are of interest not only because of the potential for reduction of the …
The hardness of minimizing design cost subject to planning problems
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 …
choose the robot's actuators? This paper addresses that question in algorithmic terms …
A general class of combinatorial filters that can be minimized efficiently
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 …
in building cheap, resource-efficient robots. But exact minimization is known to be NP-hard …
Delineating boundaries of feasibility between robot designs
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 …
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 …
designed are often ad hoc. Additionally, designers must deal with considerations including …
Accelerating combinatorial filter reduction through constraints
Reduction of combinatorial filters involves compressing state representations that robots
use. Such optimization arises in automating the construction of minimalist robots. But exact …
use. Such optimization arises in automating the construction of minimalist robots. But exact …