RESUMO
The widespread adoption of robotic technologies in healthcare has opened up new perspectives for enhancing accuracy, effectiveness and quality of medical procedures and patients' care. Special attention has been given to the reliability of robots when operating in environments shared with humans and to the users' safety, especially in case of mobile platforms able to navigate autonomously. From the analysis of the literature, it emerges that navigation tests carried out in a hospital environment are preliminary and not standardized. This paper aims to overcome the limitations in the assessment of autonomous mobile robots navigating in hospital environments by proposing: (i) a structured benchmarking protocol composed of a set of standardized tests, taking into account conditions with increasing complexity, (ii) a set of quantitative performance metrics. The proposed approach has been used in a realistic setting to assess the performance of two robotic platforms, namely HOSBOT and TIAGo, with different technical features and developed for different applications in a clinical scenario.
Assuntos
Benchmarking , Hospitais , Robótica , Benchmarking/métodos , Robótica/métodos , HumanosRESUMO
Cognitive scientists believe that adaptable intelligent agents like humans perform spatial reasoning tasks by learned causal mental simulation. The problem of learning these simulations is called predictive world modeling. We present the first framework for a learning open-vocabulary predictive world model (OV-PWM) from sensor observations. The model is implemented through a hierarchical variational autoencoder (HVAE) capable of predicting diverse and accurate fully observed environments from accumulated partial observations. We show that the OV-PWM can model high-dimensional embedding maps of latent compositional embeddings representing sets of overlapping semantics inferable by sufficient similarity inference. The OV-PWM simplifies the prior two-stage closed-set PWM approach to the single-stage end-to-end learning method. CARLA simulator experiments show that the OV-PWM can learn compact latent representations and generate diverse and accurate worlds with fine details like road markings, achieving 69 mIoU over six query semantics on an urban evaluation sequence. We propose the OV-PWM as a versatile continual learning paradigm for providing spatio-semantic memory and learned internal simulation capabilities to future general-purpose mobile robots.
RESUMO
-This paper presents a new control methodology for achieving smooth gait transitions for a hexapod robot using Central Pattern Generators (CPGs). The approach involves modifying the Phase Oscillator within the CPG network to enable smooth transitions between different gaits in order to improve the adaptability to changing environmental conditions. The foot trajectory generator is designed based on the CPG output, allowing the possibility of online adjustment of foot trajectory parameters, such as step height and size, as well as the robot's speed and direction. Our simulation demonstrates the effectiveness of the modified oscillator in achieving smoother gait transitions with a transition time falls close to the output period of the CPG oscillators, and experiments on a real hexapod robot validate the feasibility and efficiency of our approach in considering online adjustability of trajectory parameters, confirming the potential of this methodology to enhance the locomotion capabilities of legged robots for navigating complex terrains.
RESUMO
The traditional Model-Based Reinforcement Learning (MBRL) algorithm has high computational cost, poor convergence, and poor performance in robot spatial cognition and navigation tasks, and it cannot fully explain the ability of animals to quickly adapt to environmental changes and learn a variety of complex tasks. Studies have shown that vicarious trial and error (VTE) and the hippocampus forward prediction mechanism in rats and other mammals can be used as key components of action selection in MBRL to support "goal-oriented" behavior. Therefore, we propose an improved Dyna-Q algorithm inspired by the forward prediction mechanism of the hippocampus to solve the above problems and tackle the exploration-exploitation dilemma of Reinforcement Learning (RL). This algorithm alternately presents the potential path in the future for mobile robots and dynamically adjusts the sweep length according to the decision certainty, so as to determine action selection. We test the performance of the algorithm in a two-dimensional maze environment with static and dynamic obstacles, respectively. Compared with classic RL algorithms like State-Action-Reward-State-Action (SARSA) and Dyna-Q, the algorithm can speed up spatial cognition and improve the global search ability of path planning. In addition, our method reflects key features of how the brain organizes MBRL to effectively solve difficult tasks such as navigation, and it provides a new idea for spatial cognitive tasks from a biological perspective.
RESUMO
In the domain of mobile robot navigation, conventional path-planning algorithms typically rely on predefined rules and prior map information, which exhibit significant limitations when confronting unknown, intricate environments. With the rapid evolution of artificial intelligence technology, deep reinforcement learning (DRL) algorithms have demonstrated considerable effectiveness across various application scenarios. In this investigation, we introduce a self-exploration and navigation approach based on a deep reinforcement learning framework, aimed at resolving the navigation challenges of mobile robots in unfamiliar environments. Firstly, we fuse data from the robot's onboard lidar sensors and camera and integrate odometer readings with target coordinates to establish the instantaneous state of the decision environment. Subsequently, a deep neural network processes these composite inputs to generate motion control strategies, which are then integrated into the local planning component of the robot's navigation stack. Finally, we employ an innovative heuristic function capable of synthesizing map information and global objectives to select the optimal local navigation points, thereby guiding the robot progressively toward its global target point. In practical experiments, our methodology demonstrates superior performance compared to similar navigation methods in complex, unknown environments devoid of predefined map information.
RESUMO
Efficient obstacle-avoidance path planning is critical for orchards with numerous irregular obstacles. This paper presents a continuous bidirectional Quick-RRT* (CBQ-RRT*) algorithm based on the bidirectional RRT (Bi-RRT) and Quick-RRT* algorithms and proposes an expansion cost function that evaluates path smoothness and length to overcome the limitations of the Quick-RRT* algorithm for non-holonomic mobile robot applications. To improve the zigzag between dual trees caused by the dual-tree expansion of the Bi-RRT algorithm, CBQ-RRT* proposes the CreateConnectNode optimization method, which effectively solves the path smoothness problem at the junction of dual trees. Simulations conducted on the ROS platform showed that the CBQ-RRT* outperformed the unidirectional Quick-RRT* in terms of efficiency for various orchard layouts and terrain conditions. Compared to Bi-RRT*, CBQ-RRT* reduced the average path length and maximum heading angle by 8.5% and 21.7%, respectively. In addition, field tests confirmed the superior performance of the CBQ-RRT*, as evidenced by an average maximum path lateral error of 0.334 m, a significant improvement over Bi-RRT* and Quick-RRT*. These improvements demonstrate the effectiveness of the CBQ-RRT* in complex orchard environments.
RESUMO
Visual simultaneous localization and mapping (V-SLAM) plays a crucial role in the field of robotic systems, especially for interactive and collaborative mobile robots. The growing reliance on robotics has increased complexity in task execution in real-world applications. Consequently, several types of V-SLAM methods have been revealed to facilitate and streamline the functions of robots. This work aims to showcase the latest V-SLAM methodologies, offering clear selection criteria for researchers and developers to choose the right approach for their robotic applications. It chronologically presents the evolution of SLAM methods, highlighting key principles and providing comparative analyses between them. The paper focuses on the integration of the robotic ecosystem with a robot operating system (ROS) as Middleware, explores essential V-SLAM benchmark datasets, and presents demonstrative figures for each method's workflow.
RESUMO
The flexibility and versatility associated with autonomous mobile robots (AMR) have facilitated their integration into different types of industries and tasks. However, as the main objective of their implementation on the factory floor is to optimize processes and, consequently, the time associated with them, it is necessary to take into account the environment and congestion to which they are subjected. Localization, on the shop floor and in real time, is an important requirement to optimize the AMRs' trajectory management, thus avoiding livelocks and deadlocks during their movements in partnership with manual forklift operators and logistic trains. Threeof the most commonly used localization techniques in indoor environments (time of flight, angle of arrival, and time difference of arrival), as well as two of the most commonly used indoor localization methods in the industry (ultra-wideband, and ultrasound), are presented and compared in this paper. Furthermore, it identifies and compares three industrial indoor localization solutions: Qorvo, Eliko Kio, and Marvelmind, implemented in an industrial mobile platform, which is the main contribution of this paper. These solutions can be applied to both AMRs and other mobile platforms, such as forklifts and logistic trains. In terms of results, the Marvelmind system, which uses an ultrasound method, was the best solution.
RESUMO
This article is concerned with the path planning of mobile robots in dynamic environments. A new path planning strategy is proposed by integrating the improved ant colony optimization (ACO) and dynamic window approach (DWA) algorithms. An improved ACO is developed to produce a globally optimal path for mobile robots in static environments. Through improvements in the initialization of pheromones, heuristic function, and updating of pheromones, the improved ACO can lead to a shorter path with fewer turning points in fewer iterations. Based on the globally optimal path, a modified DWA is presented for the path planning of mobile robots in dynamic environments. By deleting the redundant nodes, optimizing the initial orientation, and improving the evaluation function, the modified DWA can result in a more efficient path for mobile robots to avoid moving obstacles. Some simulations are conducted in different environments, which confirm the effectiveness and superiority of the proposed path planning algorithms.
RESUMO
The leakage of gases and chemical vapors is a common accident in laboratory processes that requires a rapid response to avoid harmful effects if humans and instruments are exposed to this leakage. In this paper, the performance of a portable sensor node designed for integration with mobile and stationary robots used to transport chemical samples in automated laboratories was tested and evaluated. The sensor node has four main layers for executing several functions, such as power management, control and data preprocessing, sensing gases and environmental parameters, and communication and data transmission. The responses of three metal oxide semiconductor sensors, BME680, ENS160, and SGP41, integrated into the sensing layer have been recorded for various volumes of selected chemicals and volatile organic compounds, including ammonia, pentane, tetrahydrofuran, butanol, phenol, xylene, benzene, ethanol, methanol, acetone, toluene, and isopropanol. For mobile applications, the sensor node was attached to a sample holder on a mobile robot (ASTI ProBOT L). In addition, the sensor nodes were positioned close to automation systems, including stationary robots. The experimental results revealed that the tested sensors have a different response to the tested volumes and can be used efficiently for hazardous gas leakage detection and monitoring.
RESUMO
The ability to recognize the surface type is crucial for both indoor and outdoor mobile robots. Knowing the surface type can help indoor mobile robots move more safely and adjust their movement accordingly. However, recognizing surface characteristics is challenging since similar planes can appear substantially different; for instance, carpets come in various types and colors. To address this inherent uncertainty in vision-based surface classification, this study first generates a new, unique data set composed of 2,081 surface images (carpet, tiles, and wood) captured in different indoor environments. Secondly, the pre-trained state-of-the-art deep learning models, namely InceptionV3, VGG16, VGG19, ResNet50, Xception, InceptionResNetV2, and MobileNetV2, were utilized to recognize the surface type. Additionally, a lightweight MobileNetV2-modified model was proposed for surface classification. The proposed model has approximately four times fewer total parameters than the original MobileNetV2 model, reducing the size of the trained model weights from 42 MB to 11 MB. Thus, the proposed model can be used in robotic systems with limited computational capacity and embedded systems. Lastly, several optimizers, such as SGD, RMSProp, Adam, Adadelta, Adamax, Adagrad, and Nadam, are applied to distinguish the most efficient network. Experimental results demonstrate that the proposed model outperforms all other applied methods and existing approaches in the literature by achieving 99.52% accuracy and an average score of 99.66% in precision, recall, and F1-score. In addition to this, the proposed lightweight model was tested in real-time on a mobile robot in 11 scenarios consisting of various indoor environments such as offices, hallways, and homes, resulting in an accuracy of 99.25%. Finally, each model was evaluated in terms of model loading time and processing time. The proposed model requires less loading and processing time than the other models.
RESUMO
Wheeled mobile robots (WMRs) have a wide range of applications in logistics transportation and industrial productions, among which the motion control has always been one of the hot spots in the current WMR researches. However, most of previous designed controllers assumed that the WMR motion had no slippage. Ignoring the slippage factors usually results in a decrease in control performance and even leads to unstable motion. To address such a challenge, a kinematic model with differential flatness is established through dynamic feedback-linearization, which comprehensively considers the multidirectional slippage of mobile robot, including longitudinal and steering slippage. Subsequently, benefited from the one-to-one mapping of states and inputs to flat outputs in differential flat system, an adaptive robust control (ARC) method is proposed to stabilize the system. Different from previous robust control studies, even if the knowledge of the upper bound of system uncertainties is unknown in advance, the proposed adaptive robust controller can still achieve satisfying performance by adaptive estimation of the upper bound of system uncertainties. The effectiveness and feasibility of the proposed method are confirmed by comparative experiments on WMR with slippage disturbance.
RESUMO
Adaptive information-sampling approaches enable efficient selection of mobile robots' waypoints through which the accurate sensing and mapping of a physical process, such as the radiation or field intensity, can be obtained. A key parameter in the informative sampling objective function could be optimized balance the need to explore new information where the uncertainty is very high and to exploit the data sampled so far, with which a great deal of the underlying spatial fields can be obtained, such as the source locations or modalities of the physical process. However, works in the literature have either assumed the robot's energy is unconstrained or used a homogeneous availability of energy capacity among different robots. Therefore, this paper analyzes the impact of the adaptive information-sampling algorithm's information function used in exploration and exploitation to achieve a tradeoff between balancing the mapping, localization, and energy efficiency objectives. We use Gaussian process regression (GPR) to predict and estimate confidence bounds, thereby determining each point's informativeness. Through extensive experimental data, we provide a deeper and holistic perspective on the effect of information function parameters on the prediction map's accuracy (RMSE), confidence bound (variance), energy consumption (distance), and time spent (sample count) in both single- and multi-robot scenarios. The results provide meaningful insights into choosing the appropriate energy-aware information function parameters based on sensing objectives (e.g., source localization or mapping). Based on our analysis, we can conclude that it would be detrimental to give importance only to the uncertainty of the information function (which would explode the energy needs) or to the predictive mean of the information (which would jeopardize the mapping accuracy). By assigning more importance to the information uncertainly with some non-zero importance to the information value (e.g., 75:25 ratio), it is possible to achieve an optimal tradeoff between exploration and exploitation objectives while keeping the energy requirements manageable.
RESUMO
At the beginning of a project or research that involves the issue of autonomous navigation of mobile robots, a decision must be made about working with traditional control algorithms or algorithms based on artificial intelligence. This decision is not usually easy, as the computational capacity of the robot, the availability of information through its sensory systems and the characteristics of the environment must be taken into consideration. For this reason, this work focuses on a review of different autonomous-navigation algorithms applied to mobile robots, from which the most suitable ones have been identified for the cases in which the robot must navigate in dynamic environments. Based on the identified algorithms, a comparison of these traditional and DRL-based algorithms was made, using a robotic platform to evaluate their performance, identify their advantages and disadvantages and provide a recommendation for their use, according to the development requirements of the robot. The algorithms selected were DWA, TEB, CADRL and SAC, and the results show that-according to the application and the robot's characteristics-it is recommended to use each of them, based on different conditions.
RESUMO
Introduction: Autonomous mobile robot encompasses modules such as perception, path planning, decision-making, and control. Among these modules, path planning serves as a prerequisite for mobile robots to accomplish tasks. Enhancing path planning capability of mobile robots can effectively save costs, reduce energy consumption, and improve work efficiency. The primary slime mold algorithm (SMA) exhibits characteristics such as a reduced number of parameters, strong robustness, and a relatively high level of exploratory ability. SMA performs well in path planning for mobile robots. However, it is prone to local optimization and lacks dynamic obstacle avoidance, making it less effective in real-world settings. Methods: This paper presents an enhanced SMA (ESMA) path-planning algorithm for mobile robots. The ESMA algorithm incorporates adaptive techniques to enhance global search capabilities and integrates an artificial potential field to improve dynamic obstacle avoidance. Results and discussion: Compared to the SMA algorithm, the SMA-AGDE algorithm, which combines the Adaptive Guided Differential Evolution algorithm, and the Lévy Flight-Rotation SMA (LRSMA) algorithm, resulted in an average reduction in the minimum path length of (3.92%, 8.93%, 2.73%), along with corresponding reductions in path minimum values and processing times. Experiments show ESMA can find shortest collision-free paths for mobile robots in both static and dynamic environments.
RESUMO
This paper presents a leader-follower mobile robot control approach using onboard sensors. The follower robot is equipped with an Intel RealSense camera mounted on a rotating platform. Camera observations and ArUco markers are used to localize the robots to each other and relative to the workspace. The rotating platform allows the expansion of the perception range. As a result, the robot can use observations that are not within the camera's field of view at the same time in the localization process. The decision-making process associated with the control of camera rotation is implemented using behavior trees. In addition, measurements from encoders and IMUs are used to improve the quality of localization. Data fusion is performed using the EKF filter and allows the user to determine the robot's poses. A 3D-printed cuboidal tower is added to the leader robot with four ArUco markers located on its sides. Fiducial landmarks are placed on vertical surfaces in the workspace to improve the localization process. The experiments were performed to verify the effectiveness of the presented control algorithm. The robot operating system (ROS) was installed on both robots.
RESUMO
Real-time prediction of human location combined with the capability to perceive obstacles is crucial for socially-aware navigation in robotics. Our work focuses on localizing humans in the world and predicting the free space around them by incorporating other static and dynamic obstacles. We propose a multi-task learning strategy to handle both tasks, achieving this goal with minimal computational demands. We use a dataset captured in a typical warehouse environment by mounting a perception module consisting of a Jetson Xavier AGX and an Intel L515 LiDAR camera on a MiR100 mobile robot. Our method, which is built upon prior works in the field of human detection and localization demonstrates improved results in difficult cases that are not tackled in other works, such as human instances at a close distance or at the limits of the field of view of the capturing sensor. We further extend this work by using a lightweight network structure and integrating a free space segmentation branch that can independently segment the floor space without any prior maps or 3D data, relying instead on the characteristics of the floor. In conclusion, our method presents a lightweight and efficient solution for predicting human 3D location and segmenting the floor space for low-energy consumption platforms, tested in an industrial environment.
RESUMO
Simultaneous localization and mapping (SLAM) plays a crucial role in the field of intelligent mobile robots. However, the traditional Visual SLAM (VSLAM) framework is based on strong assumptions about static environments, which are not applicable to dynamic real-world environments. The correctness of re-localization and recall of loop closure detection are both lower when the mobile robot loses frames in a dynamic environment. Thus, in this paper, the re-localization and loop closure detection method with a semantic topology graph based on ORB-SLAM2 is proposed. First, we use YOLOv5 for object detection and label the recognized dynamic and static objects. Secondly, the topology graph is constructed using the position information of static objects in space. Then, we propose a weight expression for the topology graph to calculate the similarity of topology in different keyframes. Finally, the re-localization and loop closure detection are determined based on the value of topology similarity. Experiments on public datasets show that the semantic topology graph is effective in improving the correct rate of re-localization and the accuracy of loop closure detection in a dynamic environment.
RESUMO
An end-to-end approach to autonomous navigation that is based on deep reinforcement learning (DRL) with a survival penalty function is proposed in this paper. Two actor-critic (AC) frameworks, namely, deep deterministic policy gradient (DDPG) and twin-delayed DDPG (TD3), are employed to enable a nonholonomic wheeled mobile robot (WMR) to perform navigation in dynamic environments containing obstacles and for which no maps are available. A comprehensive reward based on the survival penalty function is introduced; this approach effectively solves the sparse reward problem and enables the WMR to move toward its target. Consecutive episodes are connected to increase the cumulative penalty for scenarios involving obstacles; this method prevents training failure and enables the WMR to plan a collision-free path. Simulations are conducted for four scenarios-movement in an obstacle-free space, in a parking lot, at an intersection without and with a central obstacle, and in a multiple obstacle space-to demonstrate the efficiency and operational safety of our method. For the same navigation environment, compared with the DDPG algorithm, the TD3 algorithm exhibits faster numerical convergence and higher stability in the training phase, as well as a higher task execution success rate in the evaluation phase.
RESUMO
The self-reconfigurable modular robotic system is a class of robots that can alter its configuration by rearranging the connectivity of their component modular units. The reconfiguration deformation planning problem is to find a sequence of reconfiguration actions to transform one reconfiguration into another. In this paper, a hybrid reconfiguration deformation planning algorithm for modular robots is presented to enable reconfiguration between initial and goal configurations. A hybrid algorithm is developed to decompose the configuration into subconfigurations with maximum commonality and implement distributed dynamic mapping of free vertices. The module mapping relationship between the initial and target configurations is then utilized to generate reconfiguration actions. Simulation and experiment results verify the effectiveness of the proposed algorithm.