Best Path in Mountain Environment based on Parallel Hill Climbing Algorithm
نویسندگان
چکیده
منابع مشابه
A Modified Mountain Clustering Algorithm based on Hill Valley Function
A modified mountain clustering algorithm based on the hill valley function is proposed. Firstly, the mountain function is constructed on the data space, with estimating the parameter by a correlation self-comparison method, and database’s mountain function values are computed. Secondly, the hill valley function is introduced to partition the data distributed on each peak. If the hill valley fun...
متن کاملParallel Stochastic Hill- Climbing with Small Teams
We address the basic problem of coordinating the actions of multiple robots that are working toward a common goal. This kind of problem is NP-hard, because in order to coordinate a system of n robots, it is in principle necessary to generate and evaluate a number of actions or plans that is exponential in n (assuming P 6= NP ). However, we suggest that many instances of coordination problems, d...
متن کاملWhen a genetic algorithm outperforms hill-climbing
A toy optimisation problem is introduced which consists of a ÿtness gradient broken up by a series of hurdles. The performance of a hill-climber and a stochastic hill-climber are computed. These are compared with the empirically observed performance of a genetic algorithm (GA) with and without. The hill-climber with a suuciently large neighbourhood outperforms the stochastic hill-climber, but i...
متن کاملPALO: A Probabilistic Hill-Climbing Algorithm
Many learning systems search through a space of possible performance elements, seeking an element whose expected utility, over the distribution of problems, is high. As the task of nding the globally optimal element is often intractable, many practical learning systems instead hill-climb to a local optimum. Unfortunately, even this is problematic as the learner typically does not know the under...
متن کاملSearch the best greedy algorithm with Hill climbing experiments for covering array generation
Many researchers have been working on the greedy algorithms for covering array generation; a framework has been built to integrate most of these greedy methods, and more new approaches can be derived from this framework. However, such a framework is affected by multiple dependent or independent factors, which makes its deployment and optimization very challenging. In this paper, we design Hill ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Advanced Computer Science and Applications
سال: 2020
ISSN: 2156-5570,2158-107X
DOI: 10.14569/ijacsa.2020.0110913