scholarly journals Real Evaluations Tractability using Continuous Goal-Directed Actions in Smart City Applications

Sensors ◽  
2018 ◽  
Vol 18 (11) ◽  
pp. 3818
Author(s):  
Raul Fernandez-Fernandez ◽  
Juan Victores ◽  
David Estevez ◽  
Carlos Balaguer

One of the most important challenges of Smart City Applications is to adapt the system to interact with non-expert users. Robot imitation frameworks aim to simplify and reduce times of robot programming by allowing users to program directly through action demonstrations. In classical robot imitation frameworks, actions are modelled using joint or Cartesian space trajectories. They accurately describe actions where geometrical characteristics are relevant, such as fixed trajectories from one pose to another. Other features, such as visual ones, are not always well represented with these pure geometrical approaches. Continuous Goal-Directed Actions (CGDA) is an alternative to these conventional methods, as it encodes actions as changes of any selected feature that can be extracted from the environment. As a consequence of this, the robot joint trajectories for execution must be fully computed to comply with this feature-agnostic encoding. This is achieved using Evolutionary Algorithms (EA), which usually requires too many evaluations to perform this evolution step in the actual robot. The current strategies involve performing evaluations in a simulated environment, transferring only the final joint trajectory to the actual robot. Smart City applications involve working in highly dynamic and complex environments, where having a precise model is not always achievable. Our goal is to study the tractability of performing these evaluations directly in a real-world scenario. Two different approaches to reduce the number of evaluations using EA, are proposed and compared. In the first approach, Particle Swarm Optimization (PSO)-based methods have been studied and compared within the CGDA framework: naïve PSO, Fitness Inheritance PSO (FI-PSO), and Adaptive Fuzzy Fitness Granulation with PSO (AFFG-PSO). The second approach studied the introduction of geometrical and velocity constraints within the CGDA framework. The effects of both approaches were analyzed and compared in the “wax” and “paint” actions, two CGDA commonly studied use cases. Results from this paper depict an important reduction in the number of required evaluations.

2011 ◽  
Vol 267 ◽  
pp. 574-577
Author(s):  
Jun Wei Zhao ◽  
Yan Qin Li ◽  
Guo Qiang Chen

Aiming at the joint robot path plan in unknown environment, the paper adopts the method of obstacle avoidance in X-Y plane. The obstacles exist in the Cartesian space are transformed into the joint blind regions in the Joint (C) space through geometry principle and inverse kinematics. The simulation using the partial particle swarm optimization (PSO) algorithm is utilized in seeking the angles that can avoid obstacles. Finally the path in the Cartesian space is obtained through transforming angles. The method is verified to be simple and effective.


2020 ◽  
Vol 39 (4) ◽  
pp. 4959-4969
Author(s):  
Weiqiang Wang

In smart city wireless network infrastructure, network node deployment directly affects network service quality. This problem can be attributed to deploying a suitable ordinary AP node as a wireless terminal access node on a given geometric plane, and deploying a special node as a gateway to aggregate. Traffic from ordinary nodes is to the wired network. In this paper, Pareto multi-objective optimization strategy is introduced into the wireless sensor network node security deployment, and an improved multi-objective particle swarm coverage algorithm based on secure connection is designed. Firstly, based on the mathematical model of Pareto multi-objective optimization, the multi-target node security deployment model is established, and the security connectivity and node network coverage are taken as the objective functions, and the problems of wireless sensor network security and network coverage quality are considered. The multi-objective particle swarm optimization algorithm is improved by adaptively adjusting the inertia weight and particle velocity update. At the same time, the elite archive strategy is used to dynamically maintain the optimal solution set. The high-frequency simulation software Matlab and simulation platform data interaction are used to realize the automatic modeling, simulation analysis, parameter prediction and iterative optimization of wireless network node deployment in smart city based on adaptive particle swarm optimization. Under the premise of meeting the performance requirements of wireless network nodes in smart cities, the experimental results show that although the proposed algorithm could not achieve the accuracy of using only particle swarm optimization algorithm to optimize the parameters of wireless network nodes in smart cities, the algorithm is completed. The antenna parameter optimization process takes less time and the optimization efficiency is higher.


Algorithms ◽  
2019 ◽  
Vol 12 (1) ◽  
pp. 15 ◽  
Author(s):  
Mayuko Sato ◽  
Yoshikazu Fukuyama ◽  
Tatsuya Iizaka ◽  
Tetsuro Matsui

This paper proposes total optimization of energy networks in a smart city by multi-population global-best modified brain storm optimization (MP-GMBSO). Efficient utilization of energy is necessary for reduction of CO2 emission, and smart city demonstration projects have been conducted around the world in order to reduce total energies and the amount of CO2 emission. The problem can be formulated as a mixed integer nonlinear programming (MINLP) problem and various evolutionary computation techniques such as particle swarm optimization (PSO), differential evolution (DE), Differential Evolutionary Particle Swarm Optimization (DEEPSO), Brain Storm Optimization (BSO), Modified BSO (MBSO), Global-best BSO (BSO), and Global-best Modified Brain Storm Optimization (GMBSO) have been applied to the problem. However, there is still room for improving solution quality. Multi-population based evolutionary computation methods have been verified to improve solution quality and the approach has a possibility for improving solution quality. The proposed MS-GMBSO utilizes only migration for multi-population models instead of abest, which is the best individual among all of sub-populations so far, and both migration and abest. Various multi-population models, migration topologies, migration policies, and the number of sub-populations are also investigated. It is verified that the proposed MP-GMBSO based method with ring topology, the W-B policy, and 320 individuals is the most effective among all of multi-population parameters.


2017 ◽  
Vol 22 (S6) ◽  
pp. 13085-13094 ◽  
Author(s):  
S. Thanga Ramya ◽  
Bhuvaneshwari Arunagiri ◽  
P. Rangarajan

2017 ◽  
Vol 13 (3) ◽  
pp. 27-37 ◽  
Author(s):  
Ahmed T. Sadiq ◽  
Firas A. Raheem

Abstract Much attention has been paid for the use of robot arm in various applications. Therefore, the optimal path finding has a significant role to upgrade and guide the arm movement. The essential function of path planning is to create a path that satisfies the aims of motion including, averting obstacles collision, reducing time interval, decreasing the path traveling cost and satisfying the kinematics constraints. In this paper, the free Cartesian space map of 2-DOF arm is constructed to attain the joints variable at each point without collision. The D*algorithm and Euclidean distance are applied to obtain the exact and estimated distances to the goal respectively. The modified Particle Swarm Optimization algorithm is proposed to find an optimal path based on the local search, D* and Euclidean distances.  The quintic polynomial equation is utilized to provide a smooth trajectory path. According to the observe results, the modified PSO algorithm is efficiently performs to find an optimal path even in difficult environments.   Keywords: D*, Free Cartesian Space, Path Planning, Particle Swarm Optimization (PSO), Robot Arm.


Sign in / Sign up

Export Citation Format

Share Document