A multi-objective route planning model based on genetic algorithm for cuboid surfaces

During a natural disaster, risk management for the evacuation of people in high-rise buildings is very important for saving lives. In the case of fire, all parameters such as detection, lighting, warning systems, etc. for safety must be used interactively. Determination of evacuation conditions and different ways out are important parameters during the fire. In this study, a system is proposed for evacuating people from building with the shortest/safest route, taking into account certain factors to evaluate the current situation of the fire. Travelling Salesman Problem (TSP) may be adapted to this real-life problem to protect people in the shortest time finding optimum route. In this study, the system based on Genetic Algorithm is performed using the online information about smoke, heat and safety level, the location of fire and the potential congestion of people in order to evacuate people from the building with safety route. The system contains two- and three-dimensional surface applications to ensure evacuation with optimum distance inside/outside of the building. Results are evaluated considering the evacuation distance. Compared to other methods in the literature, the solution to this problem is improved by adding the evacuation process for the elevator and inside of the building

E-puck motion control using multi-objective particle swarm optimization

This article describes the velocity-based motion and orientation control method for a differential-driven two-wheeled E-puck Robot (DDER) using the Multi-Objective Particle Swarm Optimization (MPSO) algorithm in the Virtual Robot Experimentation Platform (V-REP) software environment. The wheel velocities data and Infra-Red (IR) sensors reading make the multi-objective fitness functions for MPSO. We use front, left, and right IR sensors reading and right wheel velocity data to design the first fitness function for MPSO. Similarly, the front, left, and right IR sensors reading, and left wheel velocity data have been taken for making the second fitness function for MPSO. The multi-objective fitness functions of MPSO minimize the motion and orientation of the DDER during navigation. Due to the minimization of motion and orientation, the DDER covers less distance to reach the goal and takes less time. The Two-Dimensional (2D) and Three-Dimensional (3D) navigation results of the DDER among the scattered obstacles have been presented in the V-REP software environment. The comparative analysis with previously developed Invasive Weed Optimization (IWO) algorithm has also been performed to show the effectiveness and efficiency of the proposed MPSO algorithm

Online 3D Bin Packing with Constrained Deep Reinforcement Learning

We solve a challenging yet practically useful variant of 3D Bin Packing Problem (3D-BPP). In our problem, the agent has limited information about the items to be packed into the bin, and an item must be packed immediately after its arrival without buffering or readjusting. The item's placement also subjects to the constraints of collision avoidance and physical stability. We formulate this online 3D-BPP as a constrained Markov decision process. To solve the problem, we propose an effective and easy-to-implement constrained deep reinforcement learning (DRL) method under the actor-critic framework. In particular, we introduce a feasibility predictor to predict the feasibility mask for the placement actions and use it to modulate the action probabilities output by the actor during training. Such supervisions and transformations to DRL facilitate the agent to learn feasible policies efficiently. Our method can also be generalized e.g., with the ability to handle lookahead or items with different orientations. We have conducted extensive evaluation showing that the learned policy significantly outperforms the state-of-the-art methods. A user study suggests that our method attains a human-level performance

Engineering Support Systems for Industrial Machines and Plants

In the business of industrial machines and plants, rapid and detailed estimates for planning installation, replacement of equipment, or maintenance work are key requirements for meeting the demands for greater reliability, lower costs and for maintaining safe and secure operation. These demands have been addressed by developing technology driven by IT. When replacing equipment at complex building or plants with high equipment density, the existing state of the installation locations and transportation routes for old and new equipment need to be properly measured. We have met this need by developing parts recognition technology based on 3D measurement, and by developing high-speed calculation technology of optimal routes for installation parts. This chapter provides an overview of these development projects with some real business application results

A Complete Coverage Algorithm for 3D Structural Inspection using an Autonomous Unmanned Aerial Vehicle

This thesis presents a novel algorithm for complete coverage of three-dimensional structures to address the problem of autonomous structural inspection using an Unmanned Aerial Vehicle (UAV). The proposed approach uses a technique of cellular decomposition based on Morse decomposition to decompose the 3D target structure into 2D coverable faces that are subsequently connected using a graph-based representation. We then use graph traversal techniques such as the Traveling Salesman Problem (TSP) to generate a flight coverage path through the decomposed faces for a UAV to completely cover the target structure, while reducing the coverage time and distance. To test the validity of our proposed approach, we have performed a series of experiments using a simulated AscTec Firefly UAV in different environments with 3D structures of different sizes and geometries, within the Robot Operating System (ROS) Gazebo simulator. Our results show that our approach guarantees complete coverage of the target structure. Comparison of our coverage strategy with other strategies shows that our proposed TSP-based coverage strategy performs up to 50% better in reducing the flight path with an average of 30% fewer turns and 12% less coverage duration than a largest-area-first approach