Symbol Mapping Optimization for Cooperative Systems with a Hybrid Search Algorithm

2012 ◽  
Author(s):  
Rafael Lopes ◽  
Marcelo Alencar ◽  
Omar Cortes
Keyword(s):  
Search Algorithm ◽  
Cooperative Systems ◽  
Hybrid Search ◽  
Symbol Mapping

scholarly journals Reseach of Motor Energy Saving Method Based on Hybrid Search Algorithm

2019 ◽  
Vol 1176 ◽  
pp. 052028
Author(s):  
Song Chen ◽  
Dong Feng ◽  
Wenjing Li ◽  
Zhongcheng Wu
Keyword(s):  
Energy Saving ◽  
Search Algorithm ◽  
Hybrid Search

Drivable Path Planning Using Hybrid Search Algorithm Based on E* and Bernstein-Bézier Motion Primitives

2019 ◽  
pp. 1-15 ◽  
Author(s):  
Gregor Klancar ◽  
Marija Seder ◽  
Saso Blazic ◽  
Igor Skrjanc ◽  
Ivan Petrovic
Keyword(s):  
Path Planning ◽  
Search Algorithm ◽  
Hybrid Search ◽  
Motion Primitives

Movement Behavior for Soldier Agents on a Virtual Battlefield

2003 ◽  
Vol 12 (4) ◽  
pp. 387-410 ◽  
Author(s):  
Douglas A. Reece
Keyword(s):  
Search Algorithm ◽  
Human Movement ◽  
Movement Planning ◽  
Movement Behavior ◽  
Behavior Model ◽  
Topological Map ◽  
Hybrid Search ◽  
Individual Agent ◽  
Planning And Control ◽  
And Control

We have developed a movement behavior model for soldier agents who populate a virtual battlefield environment. Whereas many simulations have addressed human movement behavior before, none of them has comprehensively addressed realistic military movement at individual and unit levels. To design an appropriate movement behavior model, we found it necessary to elaborate all of the requirements on movement from the military tasks of interest, define a behavior architecture that encompasses all required movement tasks, select appropriate movement planning and control approaches in light of the requirements, and implement the planning and control algorithms with novel enhancements to achieve satisfactory results. The breadth of requirements in this problem domain makes simple behavior architectures inadequate and prevents any single planning approach from easily accomplishing all tasks. In our behavior architecture, a hierarchy of tasks is distributed over unit leaders and unit members. For movement planning, we use an A* search algorithm on a hybrid search space comprising a two-dimensional regular grid and a topological map; the plan produced is a series of waypoints annotated with posture and speed changes. Individuals control movement with reactive steering behaviors. The result is a system that can realistically plan and execute a variety of unit and individual agent movement tasks on a virtual battlefield.

Whole-Region Hybrid Search Algorithm for DSSS Signal Acquisition

2016 ◽  
Vol 95 (2) ◽  
pp. 1265-1284
Author(s):  
Yuyao Shen ◽  
Yongqing Wang ◽  
Xiuli Yu ◽  
Siliang Wu
Keyword(s):  
Search Algorithm ◽  
Signal Acquisition ◽  
Hybrid Search

scholarly journals A*+IDA*: A Simple Hybrid Search Algorithm

2019 ◽  
Author(s):  
Zhaoxing Bu ◽  
Richard E. Korf
Keyword(s):  
Search Algorithm ◽  
Original Version ◽  
Optimal Solutions ◽  
Hybrid Search ◽  
Rubik's Cube ◽  
Rubik’S Cube ◽  
Complex Algorithm ◽  
Simple Combination

We present a simple combination of A* and IDA*, which we call A*+IDA*. It runs A* until memory is almost exhausted, then runs IDA* below each frontier node without duplicate checking. It is widely believed that this algorithm is called MREC, but MREC is just IDA* with a transposition table. A*+IDA* is the first algorithm to run significantly faster than IDA* on the 24-Puzzle, by a factor of almost 5. A complex algorithm called dual search was reported to significantly outperform IDA* on the 24-Puzzle, but the original version does not. We made improvements to dual search and our version combined with A*+IDA* outperforms IDA* by a factor of 6.7 on the 24-Puzzle. Our disk-based A*+IDA* shows further improvement on several hard 24-Puzzle instances. We also found optimal solutions to a subset of random 27 and 29-Puzzle problems. A*+IDA* does not outperform IDA* on Rubik’s Cube, for reasons we explain.

Entrotaxis-Jump as a hybrid search algorithm for seeking an unknown emission source in a large-scale area with road network constraint

2020 ◽  
Vol 157 ◽  
pp. 113484 ◽  
Author(s):  
Yong Zhao ◽  
Bin Chen ◽  
Zhengqiu Zhu ◽  
Feiran Chen ◽  
Yiduo Wang ◽  
...  
Keyword(s):  
Road Network ◽  
Large Scale ◽  
Search Algorithm ◽  
Emission Source ◽  
Hybrid Search ◽  
Network Constraint

scholarly journals A Tabu-Genetic Hybrid Search Algorithm for Job-shop Scheduling Problem

2019 ◽  
Vol 95 ◽  
pp. 04007
Author(s):  
Yan Ge ◽  
Aimin Wang ◽  
Zijin Zhao ◽  
Jieran Ye
Keyword(s):  
Genetic Algorithm ◽  
Tabu Search ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Search Algorithm ◽  
Search Performance ◽  
Scheduling Problem ◽  
Job Shop Scheduling Problem ◽  
Hybrid Search ◽  
Shop Scheduling

To deal with the job-shop scheduling problem (JSP), a tabu-genetic hybrid search algorithm is proposed. The algorithm generates several initial solutions distributed in the whole solution space for tabu search by genetic algorithm, which avoids the over-dependence on the initial solution of tabu search algorithm. With the mechanism mentioned above, the algorithm proposed has both global search performance of genetic algorithm and local search performance of labu search algorithm. Finally, a program was developed with the achral data of FT (10x 10). to verify the feasibility and effectiveness of the algorithm. The result shows that the algorithm achieves satisfactory results in all indexes mentioned above.

Sign in / Sign up

Export Citation Format

Share Document