RESEARCH ON VISUAL NAVIGATION PATH DETECTION METHOD FOR DENSE PLUM GROVE

Aiming at the field management of plum grove in Inner Mongolia of China, taking the dense planting plum groves in Bikeqi town of Hohhot City as the research object, this paper proposed a visual navigation path detection algorithm for plum grove. By processing the video image information of plum grove, comparing RGB and HSV color space model, HSV color model was selected to separate the plant and background in V channel. Homomorphic filtering was used to highlight the region of interest in the image, Otsu was selected to segment the image, the intersection of plum trunk and ground was extracted as feature points, and the least square method was used to fit the navigation path. Through the comparative analysis of detection rate under different detection conditions in one day, the verification test of route accuracy was carried out. The experimental results show that: for dense planting plum grove, the average path detection accuracy of the algorithm is 70% and 73.3% under the condition of front light and weak light, respectively. The detection accuracy and real-time meet the requirements of plum grove field management, and the navigation baseline can be generated more accurately, which provides a preliminary basis for the realization of mechanical vision navigation in plum grove field management.

Vehicle Navigation System based on Pollution Metric Analysis with Q-Learning Algorithm

The navigation systems available in the present scenario takes into account the path distance for their estimations. In some advanced navigation systems, the road traffic analysis is also considered in the algorithm for their predictions. The proposed work estimates a navigation path with respect to the present pollution level on the roadways. The work suggests an alternate path to avoid additional vehicles to enter the same road which is already impacted by air pollution. A Q-learning (Quality learning) prediction algorithm is trained in the proposed work with a self-made dataset for the estimations. The experimental work presented in the paper explores the accuracy and computational speed of the developed algorithm in comparison to the traditional algorithms.

Trajectory Planning for a Mobile Robot in a Dynamic Environment using an LSTM Neural Network

Autonomous mobile robots are an important focus of current research due to the advantages they bring to the industry, such as performing dangerous tasks with greater precision than humans. An autonomous mobile robot must be able to generate a collision-free trajectory while avoiding static and dynamic obstacles from the specified start location to the target location. Machine learning, a sub-field of artificial intelligence, is applied to create a Long Short-Term Memory (LSTM) neural network that is implemented and executed to allow a mobile robot to find the trajectory between two points and navigate while avoiding a dynamic obstacle. The input of the network is the distance between the mobile robot and the obstacles thrown by the LiDAR sensor, the desired target location, and the mobile robot’s location with respect to the odometry reference frame. Using the model to learn the mapping between input and output in the sample data, the linear and angular velocity of the mobile robot are obtained. The mobile robot and its dynamic environment are simulated in Gazebo, which is an open-source 3D robotics simulator. Gazebo can be synchronized with ROS (Robot Operating System). The computational experiments show that the network model can plan a safe navigation path in a dynamic environment. The best test accuracy obtained was 99.24%, where the model can generalize other trajectories for which it was not specifically trained within a 15 cm radius of a trained destination position.

Indoor Traveling Salesman Problem (ITSP) Path Planning

With the growing complexity of indoor living environments, people have an increasing demand for indoor navigation. Currently, navigation path options in indoor are monotonous as existing navigation systems commonly offer single-source shortest-distance or fastest paths. Such path options might be not always attractive. For instance, pedestrians in a shopping mall may be interested in a path that navigates through multiple places starting from and ending at the same location. Here, we name it as the indoor traveling salesman problem (ITSP) path. As its name implies, this path type is similar to the classical outdoor traveling salesman problem (TSP), namely, the shortest path that visits a number of places exactly once and returns to the original departure place. This paper presents a general solution to the ITSP path based on Dijkstra and branch and bound (B&B) algorithm. We demonstrate and validate the method by applying it to path planning in a large shopping mall with six floors, in which the QR (Quick Response) codes are assumed to be utilized as the indoor positioning approach. The results show that the presented solution can successfully compute the ITSP paths and their potentials to apply to other indoor navigation applications at museums or hospitals.

Active Exploration for Obstacle Detection on a Mobile Humanoid Robot

Conventional approaches to robot navigation in unstructured environments rely on information acquired from the LiDAR mounted on the robot base to detect and avoid obstacles. This approach fails to detect obstacles that are too small, or that are invisible because they are outside the LiDAR’s field of view. A possible strategy is to integrate information from other sensors. In this paper, we explore the possibility of using depth information from a movable RGB-D camera mounted on the head of the robot, and investigate, in particular, active control strategies to effectively scan the environment. Existing works combine RGBD-D and 2D LiDAR data passively by fusing the current point-cloud from the RGB-D camera with the occupancy grid computed from the 2D LiDAR data, while the robot follows a given path. In contrast, we propose an optimization strategy that actively changes the position of the robot’s head, where the camera is mounted, at each point of the given navigation path; thus, we can fully exploit the RGB-D camera to detect, and hence avoid, obstacles undetected by the 2D LiDAR, such as overhanging obstacles or obstacles in blind spots. We validate our approach in both simulation environments to gather statistically significant data and real environments to show the applicability of our method to real robots. The platform used is the humanoid robot R1.

Improving Automatic Warehouse Throughput by Optimizing Task Allocation and Validating the Algorithm in a Developed Simulation Tool

It is evident that over the last years, the usage of robotics in warehouses has been rapidly increasing. The usage of robot vehicles in storage facilities has resulted in increased efficiency and improved productivity levels. The robots, however, are only as efficient as the algorithms that govern them. Many researchers have attempted to improve the efficiency of industrial robots by improving on the internal routing of a warehouse, or by finding the best locations for charging power stations. Because of the popularity of the problem, many research works can be found in the literature regarding warehouse routing. The majority of these algorithms found in the literature, however, are statically designed and cannot handle multi-robot situations, especially when robots have different characteristics. The proposed algorithm of this paper attempts to give the following solution to this issue: utilizing more than one robot simultaneously to allocate tasks and tailor the navigation path of each robot based on its characteristics, such as its speed, type and current location within the warehouse so as to minimize the task delivery timing. Moreover, the algorithm finds the optimal location for the placement of power stations. We evaluated the proposed methodology in a synthetic realistic environment and demonstrated that the algorithm is capable of finding an improved solution within a realistic time frame.