This paper is about dynamic obstacle avoidance. Delaunay Graph is used for modeling the working space, an approximate shortest path of mobile robot is determined by using floyd algorithm. Path can be found easily with...
详细信息
This paper is about dynamic obstacle avoidance. Delaunay Graph is used for modeling the working space, an approximate shortest path of mobile robot is determined by using floyd algorithm. Path can be found easily with genetic algorithm. Then genetic algorithm is used for obtaining the optimum path. It may meet which dynamic obstacle when robot follows optimum path. so it should avoid it. Results of simulation show that this path planning method is simple and realized easily.
With the rapid development of the robot technology, the autonomous conveying robot has been widely applied in the industrial and serving fields. Thus, looking for a kind time and space efficient algorithm and then pla...
详细信息
With the rapid development of the robot technology, the autonomous conveying robot has been widely applied in the industrial and serving fields. Thus, looking for a kind time and space efficient algorithm and then planning an optimal conveying path for the ACR is important to the actual application. The concept, application and path planning problems of autonomous conveying robot are generalized, and its mathematic model is also introduced. Besides, it is transformed to TSP problem and simulated annealing algorithm is adopted to get the optimal path. Moreover, some strategies are used to modify the standard SA algorithm and the converging speed is improved. A good conveying path planning example is given. Simulation results show that the proposed method is an effective approach to solve this problem and the operating efficiency is greatly improved.
Linear programming modeling is mainly concerned with solving the maximum or minimum value of a linear function under a group of linear constraints. It has been widely used in many subjects and fields. As an applicatio...
详细信息
Linear programming modeling is mainly concerned with solving the maximum or minimum value of a linear function under a group of linear constraints. It has been widely used in many subjects and fields. As an application example of linear programming, this paper decomposed two-wave salvo into three steps, used floyd algorithm and 0-1 programming to complete the task allocation model, and used Dijkstra algorithm to carry out path planning for the subsequent transfer of missile vehicles, and designed the transfer path with the highest survival rate.
Nowadays, electric vehicles (EVs) are expected to become popular together with the development of smart grid technologies. EVs are preferred, since they have low emission and less power consumption. Smart charging man...
详细信息
ISBN:
(纸本)9781479925797
Nowadays, electric vehicles (EVs) are expected to become popular together with the development of smart grid technologies. EVs are preferred, since they have low emission and less power consumption. Smart charging management, charging infrastructure and charging stations are among the crucial necessities for widely usage of EVs. Charging strategies are one of the most challenging concerns related to the charging of electric vehicle. In this study, smart charging management strategy is proposed through application of floyd algorithm, parking space and power capacity control. Proposed strategy considers substation loading data, voltage fluctuation and behavior of drivers and tries to prevent the overloading of transformers. Survey analysis is made among the academic staff and university students in Yildiz Technical University to determine drivers' behaviors. Whole campus areas including the faculty buildings, substations, parking areas are modeled with MATLAB/Simulink. EVs are successfully routed to the most suitable charge point with the developed charging management strategy algorithm. Within the scope of this study, proposed model and obtained results are discussed in detail.
In the case of live working in the distribution network, a live method of live working that satisfies the requirements for personal safety and power supply reliability needs to be studied, because of the serious safet...
详细信息
In the case of live working in the distribution network, a live method of live working that satisfies the requirements for personal safety and power supply reliability needs to be studied, because of the serious safety accidents caused by misuse and weak safety awareness. Based on the zero potential characteristics of the operating point, a new method based on injection current for zero-potential uninterrupted operation in distribution network is proposed. The floyd algorithm is used to calculate the shortest electrical distance from the live working point to the substation, and the capacitance value of the ground is measured by the resonant grounding system, and the current value injected further to the neutral point is calculated. By regulating the zero-sequence voltage, the neutral point voltage is equal to the difference between the operating phase line voltage drop and the operating phase power supply voltage, ensuring that the operating point voltage is zero. Finally, based on the PSCAD simulation software, the system model is established. The simulation verifies the feasibility of the proposed method by comparing the voltage curves of the working phase.
This article adopts Computer simulation and graph theoretic algorithm to choose the most reasonable place to convey drugs. And this article use mathematical modeling and computer programming to solve the problem of tr...
详细信息
This article adopts Computer simulation and graph theoretic algorithm to choose the most reasonable place to convey drugs. And this article use mathematical modeling and computer programming to solve the problem of transport drugs.
Since the delivery is the key point of logistics, shortest path decision is essential for the efficiency of delivery. Classical Dijkstar algorithm and floyd algorithm are analyzed from the point of view of Graph Theor...
详细信息
Since the delivery is the key point of logistics, shortest path decision is essential for the efficiency of delivery. Classical Dijkstar algorithm and floyd algorithm are analyzed from the point of view of Graph Theory. It points out these two algorithms deficiencies such as: Dijkstar algorithm efficiency will drop fast with the number of delivery point increasing, floyd algorithm mainly solves the direction graph problem and not fit for non-direction graph problem. Then some improvement methods are brought forward such as: for Dijkstar algorithm, the whole graph is divided into some child graph and then it will increase the efficiency, for floyd algorithm, the abut matrix is modified to an equal matrix and then it solves non-direction graph problem based on floyd algorithm. Finally, an example of logistics delivery route optimization based on floyd algorithm is given.
This paper presents an optimization approach to the problem of marine cargo in the Aegean, using the Simulated Annealing algorithm. Our main target is minimizing the total crossing costs of thirteen harbors in the Aeg...
详细信息
This paper presents an optimization approach to the problem of marine cargo in the Aegean, using the Simulated Annealing algorithm. Our main target is minimizing the total crossing costs of thirteen harbors in the Aegean, when a ship can visit a harbor exactly once, with regard to the total cost of fuel and port fees. Our method utilizes floyds algorithm in order to determine the minimum distances and then apply the Simulated Annealing algorithm to the hard combinatorial problem.
暂无评论