Characterizing Energy Usage of a Commercially Available Ground Robot: Method and Results

Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/106934/1/rob21507.pd

A survey on fractional order control techniques for unmanned aerial and ground vehicles

In recent years, numerous applications of science and engineering for modeling and control of unmanned aerial vehicles (UAVs) and unmanned ground vehicles (UGVs) systems based on fractional calculus have been realized. The extra fractional order derivative terms allow to optimizing the performance of the systems. The review presented in this paper focuses on the control problems of the UAVs and UGVs that have been addressed by the fractional order techniques over the last decade

Assessment of the Effect of Energy Consumption on Trajectory Improvement for a Car-like Robot

[EN] Reducing the energy consumed by a car-like mobile robot makes it possible to move at a lower cost, yet it takes more working time. This paper proposes an optimization algorithm for trajectories with optimal times and analyzes the consequences of restricting the energy consumed on the trajectory obtained for a car-like robot. When modeling the dynamic behavior of the vehicle, it is necessary to consider its inertial parameters, the behavior of the motor, and the basic properties of the tire in its interaction with the ground. To obtain collision-free, minimum-time trajectories quadratic sequential optimization techniques are used, where the objective function is the time taken by the robot to move between two given configurations. This is subject to constraints relating to the vehicle and tires as well as the energy consumed, which is the basis for this paper. We work with a real random distribution of consumed energy values following a normal Gaussian distribution in order to analyze its influence on the trajectories obtained by the vehicle. The energy consumed, the time taken, the maximum velocity reached, and the distance traveled are analyzed in order to characterize the properties of the trajectories obtained. The proposed algorithm has been applied to 101 examples, showing that the computational times needed to obtain the solutions are always lower than those required to realize the trajectories. The results obtained allow us to reach conclusions about the energy efficiency of the trajectories.Valero Chuliá, FJ.; Rubio Montoya, FJ.; Llopis Albert, C. (2019). Assessment of the Effect of Energy Consumption on Trajectory Improvement for a Car-like Robot. Robotica. 37(11):1998-2009. https://doi.org/10.1017/S0263574719000407S199820093711Rubio, F., Valero, F., Lluís Sunyer, J., & Garrido, A. (2010). The simultaneous algorithm and the best interpolation function for trajectory planning. Industrial Robot: An International Journal, 37(5), 441-451. doi:10.1108/01439911011063263Liu, S., & Sun, D. (2014). Minimizing Energy Consumption of Wheeled Mobile Robots via Optimal Motion Planning. IEEE/ASME Transactions on Mechatronics, 19(2), 401-411. doi:10.1109/tmech.2013.2241777Renny Simba, K., Uchiyama, N., & Sano, S. (2016). Real-time smooth trajectory generation for nonholonomic mobile robots using Bézier curves. Robotics and Computer-Integrated Manufacturing, 41, 31-42. doi:10.1016/j.rcim.2016.02.00

Planejamento para missões autônomas persistentes cooperativas de longo prazo

Orientador: Andre Ricardo FioravantiDissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia MecânicaResumo: Uma metodologia para abordar missões autônomas persistentes a longo prazo é apresentada juntamente com uma formalização geral do problema em hipóteses simples. É derivada uma realização dessa metodologia que reduz o problema geral para subproblemas de construção de caminho e de otimização combinatória, que são tratados com heurísticas para a computação de solução viável. Quatro estudos de caso são propostos e resolvidos com esta metodologia, mostrando que é possível obter caminhos contínuos ótimos ou subótimos aceitáveis a partir de ma representação discreta e elucidando algumas propriedades de solução nesses diferentes cenários, construindo bases para futuras escolhas educadas entre o uso de métodos exatos ou heurísticosAbstract: A Methodology for tackling Persistent Long Term Autonomous Missions is presented along with a general formalization of the problem upon simple assumptions. A realization of this methodology is derived which reduces the overall problem to a path construction and a combinatorial optimization subproblems, which are treated themselves with heuristics for feasible solution computation. Four case studies are proposed and solved with this methodology, showing that it is possible to obtain optimal or acceptable suboptimal continuous paths from a discrete representation, and elucidating some solution properties in these different scenarios, building bases for future educated choices between use of exact methods over heuristicsMestradoMecanica dos Sólidos e Projeto MecanicoMestre em Engenharia Mecânica1687532CAPE

Robot-assisted Soil Apparent Electrical Conductivity Measurements in Orchards

Soil apparent electrical conductivity (ECa) is a vital metric in Precision Agriculture and Smart Farming, as it is used for optimal water content management, geological mapping, and yield prediction. Several existing methods seeking to estimate soil electrical conductivity are available, including physical soil sampling, ground sensor installation and monitoring, and the use of sensors that can obtain proximal ECa estimates. However, such methods can be either very laborious and/or too costly for practical use over larger field canopies. Robot-assisted ECa measurements, in contrast, may offer a scalable and cost-effective solution. In this work, we present one such solution that involves a ground mobile robot equipped with a customized and adjustable platform to hold an Electromagnetic Induction (EMI) sensor to perform semi-autonomous and on-demand ECa measurements under various field conditions. The platform is designed to be easily re-configurable in terms of sensor placement; results from testing for traversability and robot-to-sensor interference across multiple case studies help establish appropriate tradeoffs for sensor placement. Further, a developed simulation software package enables rapid and accessible estimation of terrain traversability in relation to desired EMI sensor placement. Extensive experimental evaluation across different fields demonstrates that the obtained robot-assisted ECa measurements are of high linearity compared with the ground truth (data collected manually by a handheld EMI sensor) by scoring more than $90\%$ in Pearson correlation coefficient in both plot measurements and estimated ECa maps generated by kriging interpolation. The proposed robotic solution supports autonomous behavior development in the field since it utilizes the ROS navigation stack along with the RTK GNSS positioning data and features various ranging sensors.Comment: 15 pages, 16 figure

Placement and motion planning algorithms for robotic sensing systems

University of Minnesota Ph.D. dissertation. October 2014. Major: Computer Science. Advisor: Prof. Ibrahim Volkan Isler. I computer file (PDF); xxiii, 226 pages.Recent technological advances are making it possible to build teams of sensors and robots that can sense data from hard-to-reach places at unprecedented spatio-temporal scales. Robotic sensing systems hold the potential to revolutionize a diverse collection of applications such as agriculture, environmental monitoring, climate studies, security and surveillance in the near future. In order to make full use of this technology, it is crucial to complement it with efficient algorithms that plan for the sensing in these systems. In this dissertation, we develop new sensor planning algorithms and present prototype robotic sensing systems.In the first part of this dissertation, we study two problems on placing stationary sensors to cover an environment. Our objective is to place the fewest number of sensors required to ensure that every point in the environment is covered. In the first problem, we say a point is covered if it is seen by sensors from all orientations. The environment is represented as a polygon and the sensors are modeled as omnidirectional cameras. Our formulation, which builds on the well-known art gallery problem, is motivated by practical applications such as visual inspection and video-conferencing where seeing objects from all sides is crucial. In the second problem, we study how to deploy bearing sensors in order to localize a target in the environment. The sensors measure noisy bearings towards the target which can be combined to localize the target. The uncertainty in localization is a function of the placement of the sensors relative to the target. For both problems we present (i) lower bounds on the number of sensors required for an optimal algorithm, and (ii) algorithms to place at most a constant times the optimal number of sensors. In the second part of this dissertation, we study motion planning problems for mobile sensors. We start by investigating how to plan the motion of a team of aerial robots tasked with tracking targets that are moving on the ground. We then study various coverage problems that arise in two environmental monitoring applications: using robotic boats to monitor radio-tagged invasive fish in lakes, and using ground and aerial robots for data collection in precision agriculture. We formulate the coverage problems based on constraints observed in practice. We also present the design of prototype robotic systems for these applications. In the final problem, we investigate how to optimize the low-level motion of the robots to minimize their energy consumption and extend the system lifetime.This dissertation makes progress towards building robotic sensing systems along two directions. We present algorithms with strong theoretical performance guarantees, often by proving that our algorithms are optimal or that their costs are at most a constant factor away from the optimal values. We also demonstrate the feasibility and applicability of our results through system implementation and with results from simulations and extensive field experiments

Coordination of Cooperative Multi-Robot Teams

This thesis is about cooperation of multiple robots that have a common task they should fulfill, i.e., how multi-robot systems behave in cooperative scenarios. Cooperation is a very important aspect in robotics, because multiple robots can solve a task more quickly or efficiently in many situations. Specific points of interest are, how the effectiveness of the group of robots completing a task can be improved and how the amount of communication and computational requirements can be reduced. The importance of this topic lies in applications like search and rescue scenarios, where time can be a critical factor and a certain robustness and reliability are required. Further the communication can be limited by various factors and operating (multiple) robots can be a highly complicated task. A typical search and rescue mission as considered in this thesis begins with the deployment of the robot team in an unknown or partly known environment. The team can be heterogeneous in the sense that it consists of pairs of air and ground robots that assist each other. The air vehicle – abbreviated as UAV – stays within vision range of the ground vehicle or UGV. Therefrom, it provides sensing information with a camera or similar sensor that might not be available to the UGV due to distance, perspective or occlusion. A new approach to fully use the available movement range is presented and analyzed theoretically and in simulations. The UAV moves according to a dynamic coverage algorithm which is combined with a tracking controller to guarantee the visibility limitation is kept. Since the environment is at least partly unknown, an exploration method is necessary to gather information about the situation and possible targets or areas of interest. Exploring the unknown regions in a short amount of time is solved by approaching points on the frontier between known and unknown territory. To this end, a basic approach for single robot exploration that uses the traveling salesman problem is extended to multirobot exploration. The coordination, which is a central aspect of the cooperative exploration process, is realized with a pairwise optimization procedure. This new algorithm uses minimum spanning trees for cost estimation and is inspired by one of the many multi-robot coordination methods from the related literature. Again, theoretical and simulated as well as statistical analysis are used as methods to evaluate the approach. After the exploration is complete, a map of the environment with possible regions of higher importance is known by the robot team. To stay useful and ready for any further events, the robots now switch to a monitoring state where they spread out to cover the area in an optimal manner. The optimality is measured with a criterion that can be derived into a distributed control law. This leads to splitting of the robots into areas of Voronoi cells where each robot has a maximum distance to other robots and can sense any events within its assigned cell. A new variant of these Voronoi cells is introduced. They are limited by visibility and depend on a delta-contraction of the environment, which leads to automatic collision avoidance. The combination of these two aspects leads to a coverage control algorithm that works in nonconvex environments and has advantageous properties compared to related work

Optimization and Control of Cyber-Physical Vehicle Systems

A cyber-physical system (CPS) is composed of tightly-integrated computation, communication and physical elements. Medical devices, buildings, mobile devices, robots, transportation and energy systems can benefit from CPS co-design and optimization techniques. Cyber-physical vehicle systems (CPVSs) are rapidly advancing due to progress in real-time computing, control and artificial intelligence. Multidisciplinary or multi-objective design optimization maximizes CPS efficiency, capability and safety, while online regulation enables the vehicle to be responsive to disturbances, modeling errors and uncertainties. CPVS optimization occurs at design-time and at run-time. This paper surveys the run-time cooperative optimization or co-optimization of cyber and physical systems, which have historically been considered separately. A run-time CPVS is also cooperatively regulated or co-regulated when cyber and physical resources are utilized in a manner that is responsive to both cyber and physical system requirements. This paper surveys research that considers both cyber and physical resources in co-optimization and co-regulation schemes with applications to mobile robotic and vehicle systems. Time-varying sampling patterns, sensor scheduling, anytime control, feedback scheduling, task and motion planning and resource sharing are examined