The so-called problem of path planning refers to the computation of an optimal path for the movement of a robot from the origin to the destination without colliding with any obstacles. In this study, three main steps ...
详细信息
The so-called problem of path planning refers to the computation of an optimal path for the movement of a robot from the origin to the destination without colliding with any obstacles. In this study, three main steps are used to solve the problem of path planning. First, we calculate the minimum distance of the path from the origin to the destination with no obstacles in the environment. Then, we consider the case where the robot comes across an obstacle along the aforementioned path. In this case, we set a turning point that is close to the collision point and is within an obstacle-free area. In the third step, we set a new path that crosses this turning point. We use these three steps in a loop until an obstaclefree path is found. Further, we select six types of obstacles for a simulation utilizing the proposed algorithm. This algorithm requires little time and only a relatively small number of rounds to calculate the path. In particular, in a simple environment, it is quite efficient. We also compare the proposed algorithm with the hierarchical evolutionary algorithms. The comparison results reveal that the proposed algorithm requires close to just half the number of rounds required by the hierarchical evolutionary algorithms. Furthermore, the amount of memory needed to store the path tree is just one-twentieth that required in the case of hierarchical evolutionary algorithms. Hence, the proposed algorithm requires fewer system resources and has a lower computation time than do the hierarchical evolutionary algorithms.
Consecutive example mining is a critical subfield in information mining and it's a troublesome issue since mining may require assembling or looking at expansive number of subsequence blends. Instructions to viably...
详细信息
ISBN:
(纸本)9781509032945
Consecutive example mining is a critical subfield in information mining and it's a troublesome issue since mining may require assembling or looking at expansive number of subsequence blends. Instructions to viably and productively mine interim based successions is testing issue. Three sort of interim based examples which utilize greedy calculation, to find three kind of interim based successive examples. Time is inescapable of reality, and various social database approaches have been made to adjust to it. In realistic applications, facts can go over a couple times, and simply the general time span containing each one of the emphases may be known (consider, e.g., On January, John went to five social affairs of the Bioinformatics wander). While some brief social databases have defied, substances repeated at (known) incidental time, or single truths happened at fleetingly unverifiable time.
The paper studies convergence of the greedy algorithm by the Walsh system in the space C(0, 1). Some sufficient conditions for uniform convergence are given. It is proved that there exists a function satisfying more r...
详细信息
The paper studies convergence of the greedy algorithm by the Walsh system in the space C(0, 1). Some sufficient conditions for uniform convergence are given. It is proved that there exists a function satisfying more restrictive conditions, for which the sequence of the partial sums of the Fourier-Walsh series diverges at the point 0.
The optimal configuration of heliostat field is one of the key technologies in the design of tower solar collector system, and its layout and configuration directly affect the solar collector efficiency. This work pre...
详细信息
ISBN:
(纸本)9798350389555;9798350389548
The optimal configuration of heliostat field is one of the key technologies in the design of tower solar collector system, and its layout and configuration directly affect the solar collector efficiency. This work presents a novel optimisation strategy that combines genetic algorithm and greedy algorithm. The proposed strategy is developed by examining the constraints of conventional methods for optimising heliostat fields. The strategy uses the global search capability of genetic algorithm combined with the local optimal decision of greedy algorithm to improve the efficiency and performance of the fixed heliostat field configuration. Initially, the relevant mathematical model of the fixed heliostat field is established, and then on the basis of the genetic algorithm, the greedy algorithm is introduced to locally optimise the individuals in the population of each generation, so as to accelerate the speed of convergence and improve the quality of the solution. This research validates the feasibility and accuracy of the model and algorithm. Use python to conduct simulation experiment, showing the potential of the optimisation algorithm to be applied in the design of solar thermal collector systems.
For the problem of distribution center location about 0-1 mixed integer programming, the necessary and sufficient conditions for the solvable model are given. A heuristic algorithm is designed with the idea of the gre...
详细信息
ISBN:
(纸本)9783037852156
For the problem of distribution center location about 0-1 mixed integer programming, the necessary and sufficient conditions for the solvable model are given. A heuristic algorithm is designed with the idea of the greedy algorithm by further combined the model characteristics. It is proved that the algorithm could quickly converge to satisfactory solution, and the algorithm is bounded by polynomial time, and the complexity of the algorithm is given.
In this paper, a multi-objective units start-up optimization strategy is proposed. In the proposed model, the economic factors during generator start-up are introduced into the conventional units start-up objective fu...
详细信息
ISBN:
(纸本)9781479928255;9781479928279
In this paper, a multi-objective units start-up optimization strategy is proposed. In the proposed model, the economic factors during generator start-up are introduced into the conventional units start-up objective function. Furthermore, the system frequency characteristics as well as generator ramp constraints are considered during analysis. The greedy algorithm is employed to solve the proposed model. Finally, the case studies are carried out based on the IEEE 30-bus test system as benchmark to demonstrate the effectiveness and validity of the proposed model and method.
In the primitive greedy algorithm for shortest superstring, if a pair of strings with maximum overlap picked out, they are subsequently merged. In this paper, we introduce the concept of optimal set and generalize the...
详细信息
ISBN:
(纸本)9783642024689
In the primitive greedy algorithm for shortest superstring, if a pair of strings with maximum overlap picked out, they are subsequently merged. In this paper, we introduce the concept of optimal set and generalize the primitive greedy algorithm. The generalized algorithm can be reduced to the primitive greedy algorithm if the relative optimal set is empty. Consequently, the new algorithm achieves a better bound at the expense of cost. But the cost is acceptable in practice.
greedy algorithm always makes the best choice at moment. In other words, without considering the overall optimality, what it has done is a partial optimal in a situation. The greedy algorithm is not the best solution ...
详细信息
ISBN:
(纸本)9789811368615;9789811368608
greedy algorithm always makes the best choice at moment. In other words, without considering the overall optimality, what it has done is a partial optimal in a situation. The greedy algorithm is not the best solution for all problems. For the issues involved in this paper, the advantage of greedy algorithm is more correct and the choice of greedy strategy is only relevant to the current state.
The cryptographic property of normality for cubic Boolean functions is studied in this paper. This property is highly relevant for the analysis and design of important building blocks in cryptosystems. We develop a no...
详细信息
ISBN:
(纸本)9784885522673
The cryptographic property of normality for cubic Boolean functions is studied in this paper. This property is highly relevant for the analysis and design of important building blocks in cryptosystems. We develop a novel greedy algorithm to find whether a given function is normal and the affine subspace where this property occurs. Our algorithm exploits the fact that cubic functions admit a matrix representation to work with tools having fast implementations. Thus, the proposed algorithm achieves a much lower complexity than other well known general techniques in the literature.
This paper studies the Containership Stowage Stack Minimization Problem(CSSMP) under a circular route so as to obtain the containership stowage plan for each port. This paper analyzes the process of multi-port contain...
详细信息
ISBN:
(纸本)9781728143903
This paper studies the Containership Stowage Stack Minimization Problem(CSSMP) under a circular route so as to obtain the containership stowage plan for each port. This paper analyzes the process of multi-port containership stowage problem under the circular route, taking into consideration the sequence of port of call and container information of each port. A greedy algorithm is designed to solve the problem. The efficiency of the algorithm is verified by analyzing the results of the instances and therefore some rules can be obtained to provide reference for subsequent research.
暂无评论