Randy A. Freeman

Randy A. Freeman

Auto-generated profile, based on publicly available information

Randy A. Freeman

Center for Robotics and Biosystems, Department of Electrical and Computer Engineering, Northwestern Institute on Complex Systems, Northwestern University, Evanston, IL, USA

Research Focus & Metrics

Academic Career Length

25Years (2002-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
26 February 2019 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
JGJemin George
Jemin George
RFRandy A. Freeman
Randy A. Freeman

2 December 2022 in IEEE Robotics and Automation Letters
Verified
Journal Article
Closed access
MEMatthew L. Elwin
Matthew L. Elwin
BSBillie Strong
Billie Strong
RFRandy A. Freeman
Randy A. Freeman
KLKevin M. Lynch
Kevin M. Lynch
The Omnid human-collaborative mobile manipulators are an experimental platform for testing control architectures for autonomous and human-collaborative multirobot mobile manipulation. An Omnid consists of a mecanum-wheel omnidirectional mobile base and a series-elastic Delta-type parallel manipulator, and it is a specific implementation of a broader class of mobile collaborative robots (“mocobots”) suitable for safe human co-manipulation of delicate, flexible, and articulated payloads. Key features of mocobots include passive compliance, for the safety of the human and the payload, and high-fidelity end-effector force control independent of the potentially imprecise motions of the mobile base. We describe general considerations for the design of teams of mocobots; the design of the Omnids in light of these considerations; manipulator and mobile base controllers to achieve multirobot collaborative behaviors; and experiments in human-multirobot collaborative mobile manipulation of large and articulated payloads, where the mocobot team renders the payloads weightless for effortless human co-manipulation. In these experiments, the only communication among the humans and Omnids is mechanical, through the payload.

26 September 2019 in IEEE Transactions on Robotics
Verified
Journal Article
Closed access
MEMatthew L. Elwin
Matthew L. Elwin
RFRandy A. Freeman
Randy A. Freeman
KLKevin M. Lynch
Kevin M. Lynch
We introduce a distributed finite element algorithm that allows swarms of mobile robots to persistently monitor environmental quantities such as temperature or salinity. The robots deploy themselves into the environment, covering the domain and dividing it into nonoverlapping regions. Each robot estimates the environment over its own region using local measurements and communication with nearby robots. The algorithm ensures that each robot’s estimate constitutes a piece of a global estimate that spans the entire domain, fuses the whole swarm’s measurements, and accounts for the spatial correlation between measurement and estimation locations. By incorporating spatial correlation without requiring the transmission of measurements or measurement locations, the algorithm decouples its communication requirements from the spatial statistics of the environment and enables robots with fixed capabilities to monitor environments with different spatial correlation lengths. Analysis and simulation demonstrate that, as the number of robots increases, the memory and communication requirements of each individual robot decrease until reaching a minimum, after which the resolution of the environmental model increases. Additional robots, therefore, add computational resources to the swarm rather than introducing extra computational burdens.

8 March 2019 in IEEE Transactions on Control of Network Systems
Verified
Journal Article
Closed access
DLDaniel Alberto Burbano Lombana
Daniel Alberto Burbano Lombana
RFRandy A. Freeman
Randy A. Freeman
KLKevin Lynch
Kevin Lynch

8 February 2017 in IEEE Robotics and Automation Letters
Verified
Journal Article
Closed access
MEMatthew L. Elwin
Matthew L. Elwin
RFRandy A. Freeman
Randy A. Freeman
KLKevin M. Lynch
Kevin M. Lynch
Algorithms for identifying Voronoi neighbors and constructing Voronoi regions are useful in many distributed robotics applications. Existing methods that perform these tasks using only the distances between robots assign coordinates to each potential neighbor before applying another algorithm to find the Voronoi neighbors. Our method finds the Voronoi neighbors more efficiently; identification occurs directly from inter-robot distances, without first assigning coordinates. We prove the algorithm’s correctness, analyze its computational complexity, and demonstrate its effectiveness in the presence of noise via simulation with an experimentally validated sensor model.

17 December 2002
Verified
Conference Paper
Closed access
RFR.A. Freeman
R.A. Freeman
PKP.V. Kokotovic
P.V. Kokotovic