Division of Mathematical Science for Social Systems, Department of Systems Innovation, Graduate School of Engineering Science, Osaka University, Osaka, Japan
Dr. Tatsushi Nishi
Division of Mathematical Science for Social Systems, Department of Systems Innovation, Graduate School of Engineering Science, Osaka University, Osaka, Japan
The implementation of Industry 5.0 necessitates a decrease in the energy consumption of industrial robots. This research investigates energy optimization for optimal motion planning for a dual-arm industrial robot. The objective function for the energy minimization problem is stated based on the execution time and total energy consumption of the robot arm configurations in its workspace for pick-and-place operation. Firstly, the PID controller is being used to achieve the optimal parameters. The parameters of PID are then fine-tuned using metaheuristic algorithms such as Genetic Algorithms and Particle Swarm Optimization methods to create a more precise robot motion trajectory, resulting in an energy-efficient robot configuration. The results for different robot configurations were compared with both motion planning algorithms, which shows better compatibility in terms of both execution time and energy efficiency. The feasibility of the algorithms is demonstrated by conducting experiments on a dual-arm robot, named as duAro. In terms of energy efficiency, the results show that dual-arm motions can save more energy than single-arm motions for an industrial robot. Furthermore, combining the robot configuration problem with metaheuristic approaches saves energy consumption and robot execution time when compared to motion planning with PID controllers alone.
16 September 2014 in The International Journal of Advanced Manufacturing Technology
This paper studies the solution procedure to the problem of conflict-free route planning for automated guided vehicles for just-in-time delivery to minimize the earliness and tardiness of a specified delivery time while minimizing the total completion time. The characteristic of the problem is that a vehicle can have an idle time at any nodes considering dispatching of dynamic task arrivals. This problem is modeled by a time-space network where the pickup and delivery tasks are dynamically scheduled. A heuristic solution procedure is developed to derive a conflict-free routing problem such that earliness and tardiness penalties are minimized while the total completion time of each task is also minimized under dynamic task arrivals. The effectiveness of the proposed method is demonstrated by comparing the performance with Gurobi from computational results. The results show that the proposed method can obtain a better solution that is close to an optimal solution with significantly shorter computational time than that derived from Gurobi. The trade-off relationship between earliness/tardiness penalties and the total completion time is investigated in various situations. The effects of the interval of task assignment on the performance of earliness/tardiness and the total completion time are studied. The computational results show the conditions when the trade-off relationship can be obtained. Note to Practitioners—The multiple AGVs are used in public transportation and social systems with rapid development of artificial intelligence and optimization methods. The benefits of AGV affect the reduction of congestion, traffic police, legal services, and economic savings in the manufacturing and logistics industries. In order to satisfy the customer’s demands, it is requested to deliver the products just-in-time for the desired time without decreasing the total system performance. This paper presents the dispatching and conflict-free routing of AGVs for just-in-time transportation while minimizing the total completion time of the tasks. In many real factories with multiple production processes, the shortest time transportation may sometimes cause the congestions of AGVs waiting for handling or overstocked. Just-in-time transportation is required not only to reduce inventories but also to supply only when it is needed. Computational results show the situations when the just-in-time delivery and the minimization of the total completion time can be achieved.
This paper presents an extension of the covering location problem as a hybrid covering model that utilizes the set covering and maximal covering location problems. The developed model is a multi-period model that considers strategic and tactical planning decisions. Hybrid covering location problem (HCLP) determines the location of the capacitated facilities by using dynamic set covering location problem as strategic decisions and assigns the constructive units of facilities and allocates the demand points by using dynamic modular capacitated maximal covering location problem as tactical decisions. One of the applications of the proposed model is locating first aid centers in humanitarian logistic services that have been addressed by studying a threat case study in Japan. In addition to validating the developed model, it has been compared to other possible combined problems, and several randomly generated examples have been solved. The results of the case study and model validation tests approve that the main hybrid developed model (HCLP) is capable of providing better coverage percentage compared to conventional covering models and other hybrid variants.
The paper aims to study a multi-period maximal covering location problem with the configuration of different types of facilities, as an extension of the classical maximal covering location problem (MCLP). The proposed model can have applications such as locating disaster relief facilities, hospitals, and chain supermarkets. The facilities are supposed to be comprised of various units, called the modules. The modules have different sizes and can transfer between facilities during the planning horizon according to demand variation. Both the facilities and modules are capacitated as a real-life fact. To solve the problem, two upper bounds—(LR1) and (LR2)—and Lagrangian decomposition (LD) are developed. Two lower bounds are computed from feasible solutions obtained from (LR1), (LR2), and (LD) and a novel heuristic algorithm. The results demonstrate that the LD method combined with the lower bound obtained from the developed heuristic method (LD-HLB) shows better performance and is preferred to solve both small- and large-scale problems in terms of bound tightness and efficiency especially for solving large-scale problems. The upper bounds and lower bounds generated by the solution procedures can be used as the profit approximation by the managerial executives in their decision-making process.