Soccer robot optimal tactics strategy research based on particle algorithm
Soccer robot is a kind of synthetic multi-agent that fuses information
Articles, journals and conferences in one search. An exact title, DOI or ISSN is listed first.
In the search box: "exact phrase" · -leave out · OR · prefix* · title: author: journal:
Soccer robot is a kind of synthetic multi-agent that fuses information
various in kind; ball-picking way mainly divides into recirculation principle, proximity principle and shortest path optimization principle such three kinds. At present, world developed achievements can let robot…
mainly divided into the reciprocating cycle principle, principle of nearby, and three kinds of shortest path optimization principle. The present results can already make the machine in the world developed ... direction…
impulsiveness. To decrease the computational complexity, the proposed approach is utilizing only shortest paths joining the border of a window with its center. In the 5x5 filtering window only
interface or arbitration protocols. By using a bus gating technique, data transactions can take shortest paths on chip, reducing the power consumption of bus wires to minimal. Routing resource ... bandwidth capacity are…
analyze common pathways in these networks, which will contribute a lot to their understanding. Shortest path plays a great importance in network biology and it is the area of research ... called IMPROT which analyzes…
core functions to efficiently utilize the capacity of cooperative control for getting shortest path which can minimize the completion time. A new methodology that is supported on Travelling Salesman Problem ... task…
extracted from Functional Magnetic Resonance Imaging (fMRI) data. Afterwards node degree, clustering coefficient and shortest path length are used to analyse the functional characteristics of networks. Finally, the…
named Dhaka in Bangladesh. In this research, the effects of DTN movement models i.e., shortest path map based (SPMB), random way point (RWP), random Walk (RW), and delay- tolerant routing ... scenario the best suitable…
with breast cancer metastasis to bone on a protein-protein interaction network with a shortest path algorithm. Journal of Proteome Research. 16(2):1027- 1038. 2. Zhang N, Wang ... drivers connecting different…
problems in this field is the Hamiltonian Path Problem which consists in determining the shortest path traversing each node of a directed graph exactly once and returning to the last
final routing path has been generated as close as possible to the shortest path routing. If the greedy forwarding fails (when the routing void problem occurs), the virtual optimal
Obtaining of the shortest path set plays an important role in traffic network calculation n .However, most of existing algorithms do not consider the delay in the intersection
used for receiving the current position and finding the current position and finding the shortest path to the destination. The navigation process of the system will start once the user
topological index of a molecule, defined as the sum of the lengths of the shortest paths between all pairs of vertices in the chemical graph representing the non-hydrogen atoms
investigate application for Particle Swarm Optimization (PSO) to robot mobility problem to determine a shortest path possible with minimum time required to move from starting point to target point
great need of trust scheme and also an optimization technique so that shortest path can be find out between the two communicating nodes in MANET. In this paper firstly
nodules along the same pathway. The total EPs are exactly enumerated along all possible shortest paths between every dyad of nodules, and the functional form of the EP distribution ... exploring nonequilibrium…
weakness in routing because the traditional back-pressure algorithm explores and exploits all feasible paths between each source and destination. While this extensive exploration is essential in order to maintain…
minimum weighted routing with the geographical location has been followed to obtain the shortest path connectivity, but resulted in higher number of hop counts. The greedy routing technique is introduced ... proposed…
Tree by using Kruskal algorithm and graph search Dijkstra’s Algorithm to find the shortest path between two points, Also, for this case was developed a network model
locationbased systems. Three types of location-based queries on road networks, single-pair shortest path, query, k nearest neighbor (KNN) query, and keyword-based KNN query, are widely used
material on fly. Moreover, the mobile application includes additional features, such as providing the shortest path via the navigation service, detecting more than one object simultaneously, location sharing, personal…
optimization problems by proposing algorithms on ant behavior i.e. Ant Colony Optimization to find shortest paths from source to destination. Ant colonies present highly structured social organizations in distributed…
interaction network with 1482 nodes and 3105 edges was built using a MapReduce based shortest path algorithm. Within this, 7 functional cliques were identified using a network clustering method
For authors and organisers
Find the right journal for your paper and submit your manuscript.