Solving the potential field local minimum problem using internal agent states
نویسندگان
چکیده
منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولSolving the minimum labelling spanning tree problem using hybrid local search
Given a connected, undirected graph whose edges are labelled (or coloured), the minimum labelling spanning tree (MLST) problem seeks a spanning tree whose edges have the smallest number of distinct labels (or colours). In recent work, the MLST problem has been shown to be NP-hard and some effective heuristics (Modified Genetic Algorithm (MGA) and Pilot Method (PILOT)) have been proposed and ana...
متن کاملThe Effective Potential Function of the Liquid Mercury on the Metallic and Nonmetallic States by Using the Experimental Internal Pressure
The major reason for the prediction of thermodynamic properties of mercury lies in the fact that itsintermolecular interactions highly depend on temperature and density. Internal pressure is a good criterion toinvestigate the density dependence of the interatomic interactions. Because its physical base is a forcetending to close together the molecules that is intermolecular interactions, and as...
متن کاملSolving the local positioning problem using a four-layer artificial neural network
Today, the global positioning systems (GPS) do not work well in buildings and in dense urban areas when there is no lines of sight between the user and their satellites. Hence, the local positioning system (LPS) has been considerably used in recent years. The main purpose of this research is to provide a four-layer artificial neural network based on nonlinear system solver (NLANN) for local pos...
متن کاملSolving the minimum-weighted coloring problem
Weighted coloring is a generalization of the wellknown vertex (unweighted) coloring for which a number of exact algorithms have been presented in the literature. We are not aware of any optimal method specifically designed for the minimum-weighted coloring problem on arbitrary graphs. Only a few heuristics have been developed with the goal of finding tighter upper bounds for the maximum-weighte...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Robotics and Autonomous Systems
سال: 2008
ISSN: 0921-8890
DOI: 10.1016/j.robot.2008.09.006