1,028 Hits in 5.2 sec

Effective Variants of the Max-Sum Algorithm for Radar Coordination and Scheduling

Yoonheui Kim, Michael Krainin, Victor Lesser
2011 2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology  
These techniques facilitate effective problem solving through the use of a pre-computed policy and two phase propagation on Max-Sum algorithm, one inside the clustered resources and one among clustered  ...  This approach shows equivalent quality to the standard Max-Sum algorithm while reducing communication requirements on average by 50% and computation resources by 5 to 30% depending on the specific problem  ...  We would like to thank Alessandro Farinelli, Alex Rogers, and Ruben Stranders of the University of Southampton for their assistance in this project.  ... 
doi:10.1109/wi-iat.2011.247 dblp:conf/iat/KimKL11 fatcat:tyqgelolobcdbecpirp6tmapu4

Speeding Up Incomplete GDL-based Algorithms for Multi-agent Optimization with Dense Local Utilities

Yanchen Deng, Bo An
2020 Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence  
Incomplete GDL-based algorithms including Max-sum and its variants are important methods for multi-agent optimization.  ...  In this paper, we present several novel sorting-based acceleration algorithms by alleviating the effect of densely distributed local utilities.  ...  Acknowledgements This research is supported by Singapore National Research Foundation projects AISG-RP2019-0013, NSOE-TSS2019-01, and NTU.  ... 
doi:10.24963/ijcai.2020/5 dblp:conf/ijcai/DengA20 fatcat:eqmrd4v4tzabxn4ge6yll7gia4

Multiphysical simulation of a semi-autonomous solar powered high altitude pseudo-satellite

Reiko Muller, Jane Jean Kiam, Federico Mothes
2018 2018 IEEE Aerospace Conference  
To this end, simulated example missions over Bavaria are presented showcasing these effects, where mission success is ensured by means of the long term mission planner, the reactive guidance, and the inner-level  ...  Ascending to and descending from mission altitude of approximately 18 km also poses a threat to the lightweight HAPS construction since layers of stronger winds and atmospheric disturbance have to be passed  ...  Thanks also go to Andreas Langmeier and Erwin Stenzel (Airbus Group Innovations) for provision of the radar simulation and help with the OPERA data, Andreas Klöckner (DLR-PD) for the work performed in  ... 
doi:10.1109/aero.2018.8396531 fatcat:iol7sahrqrefbcp42xzr2y6cmy

Unsupervised learning with stochastic gradient

Harold Szu, Ivica Kopriva
2005 Neurocomputing  
temperature T 0 was introduced generalizing the Shannon maximum entropy S of the closed systems to the open systems having non-zero input-output energy exchange E.  ...  Here, only the input data vector was known while source vector and mixing matrix were unknown.  ...  times at each time t, and the cooling schedule algorithm is admissible. & To apply CSA to D-dimensional problems, we had to introduce the transformation from Cartesian to hyper-spherical coordinates in  ... 
doi:10.1016/j.neucom.2004.11.010 fatcat:gkmkkmfkujhrjlzze5ygyugpsm

Variable neighbourhood search: methods and applications

Pierre Hansen, Nenad Mladenović, José A. Moreno Pérez
2008 4OR  
It consists of steps for developing a heuristic for any particular problem. Those steps are common to the implementation of other metaheuristics.  ...  Variable neighbourhood search (VNS) is a metaheuristic, or a framework for building heuristics, based upon systematic changes of neighbourhoods both in descent phase, to find a local minimum, and in perturbation  ...  The third author was partly supported by project TIN2005-08404-C04-03 of the Spanish Government (with financial support from the E.U. under the FEDER project) and project PI042005/044 of the Canary Government  ... 
doi:10.1007/s10288-008-0089-1 fatcat:3iqvqsdfdra6fn6v3ne5rv2f64

A penalty search algorithm for the obstacle neutralization problem

Ali Fuat Alkaya, Vural Aksakalli, Carey E. Priebe
2015 Computers & Operations Research  
In this study, we propose a simple, yet efficient and effective suboptimal algorithm for ONP based on the idea of penalty search and we present special cases where our algorithm is provably optimal.  ...  An instance of ONP is shown in Our goal in this study is to present a simple, fast, efficient, and scalable algorithm for ONP which we call Penalty Search Algorithm (PSA).  ...  Then we propose the Penalty Search Algorithm (PSA) for ONP which is a simple, effective, and scalable suboptimal algorithm for ONP.  ... 
doi:10.1016/j.cor.2014.08.013 fatcat:f3oyn3mlhvgwfi2hndr2y3zspi

An efficient Associative Processor solution to an Air Traffic Control problem

Mike Yuan, Johnnie Baker, Frank Drews, Lev Neiman, Will Meilander
2010 2010 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum (IPDPSW)  
The performance of CSX600 has better scalability, efficiency, and predictability than that of MIMD.  ...  Additionally, the associative processor is enhanced SIMD hardware and is considerably cheaper and simpler than the MIMD hardware currently used to support ATC.  ...  ACKNOWLEDGMENTS We wish to thank anonymous reviewers for their valuable comments, which were very useful in the production of the final version of this paper.  ... 
doi:10.1109/ipdpsw.2010.5470820 dblp:conf/ipps/YuanBDNM10 fatcat:ttnivufrgnd7rf7t563wmgh3fu

Probabilistic data association techniques for target tracking with applications to sonar, radar and EO sensors

Y. Bar-Shalom, T. Kirubarajan, X. Lin
2005 IEEE Aerospace and Electronic Systems Magazine  
The use of the PDA technique for tracking highly maneuvering targets combined radar resource management is described.  ...  This, while still a batch procedure, has the flexibility of varying the batches depending on the estimation results in order to make the estimation robust to target maneuvers as well as target appearance  ...  The coordinate selection for tracking, radar scheduling/pointing and the models used for mode-matched filtering (the modules inside the IMM estimator) are also discussed.  ... 
doi:10.1109/maes.2005.1499275 fatcat:twe6tkf46fb2zoxybp5kjgknoa

Learning the Quality of Sensor Data in Distributed Decision Fusion

Bin Yu, Katia Sycara
2006 2006 9th International Conference on Information Fusion  
Several examples are provided to show the effectiveness of our approach.  ...  We provide a novel learning algorithm for determining the quality of sensor data in the fusion process.  ...  The authors would also like to thank our partners at Northrop-Grumman for their assistance in developing some of the external sensor simulators.  ... 
doi:10.1109/icif.2006.301632 dblp:conf/fusion/YuS06 fatcat:wd7qkmp2xjdazol23ttu6tuhu4

Methods and Applications [chapter]

1997 After the Event  
a perturbation phase to get out of the corresponding valley.  ...  Abstract Variable neighborhood search (VNS) is a metaheuristic, or framework for building heuristics, based upon systematic change of neighborhoods both in a decent phase to find a local minimum, and in  ...  ; 8 t ← CpuTime() 9 until t > t max ; Algorithm 11: Steps of the basic Best Improvement VNS Another variant of the basic VNS could be to find a solution x ′ in Step 2a as the best among b (a parameter)  ... 
doi:10.1016/b978-008043074-4/50023-5 fatcat:7clkbkmqtbgkjdpzgzpjl7ug5e

Max-Min Fair Resource Allocation in Millimetre-Wave Backhauls [article]

Rui Li, Paul Patras
2019 arXiv   pre-print
In this paper, we propose WiHaul, an airtime allocation and scheduling mechanism that overcomes these challenges specific to multi-hop mm-wave networks, guarantees max-min fairness among traffic flows,  ...  In particular, resource allocation and scheduling of very narrow transmission/ reception beams requires to overcome terminal deafness and link blockage problems, while managing fairness issues that arise  ...  j with Algorithm 1 2: H = BUILD SCHEDULING HIERARCHY(network topology) 3: Root coordinator of H assigns slots to its child nodes, i.e.  ... 
arXiv:1709.07078v2 fatcat:rpg4vmg72vfkvlkgbwbzjogxea

Max-Min Fair Resource Allocation in Millimetre-Wave Backhauls

Rui Li, Paul Patras
2019 IEEE Transactions on Mobile Computing  
j with Algorithm 1 2: H = BUILD SCHEDULING HIERARCHY(network topology) 3: Root coordinator of H assigns slots to its child nodes, i.e.  ...  Progressive Filling Algorithm Algorithm 1 summarises the progressive filling procedure we propose to achieve max-min fair allocation of the backhaul resources under clique and demand constraints, and we  ... 
doi:10.1109/tmc.2019.2917205 fatcat:5it6b6pmvbew7hdp6redye5c5e

Deep Instance Segmentation with Automotive Radar Detection Points [article]

Jianan Liu, Weiyi Xiong, Liping Bai, Yuxuan Xia, Tao Huang, Wanli Ouyang, Bing Zhu
2022 arXiv   pre-print
Its data contain contexts such as radar cross section and micro-Doppler effects, and sometimes can provide detection when the field of view is obscured.  ...  Automotive radar provides reliable environmental perception in all-weather conditions with affordable cost, but it hardly supplies semantic and geometry information due to the sparsity of radar detection  ...  are sum-of gMLP lf attention son.  ... 
arXiv:2110.01775v6 fatcat:ryhi73z53bhdldmcglq7ucgz5m

A Hybrid Differential Evolution Algorithm and Its Application in Unmanned Combat Aerial Vehicle Path Planning

Jeng-Shyang Pan, Nengxian Liu, Shu-Chuan Chu
2020 IEEE Access  
CIPDE and JADE are two powerful and effective Differential Evolution (DE) algorithms with strong exploration and exploitation capabilities.  ...  In order to take advantage of these two algorithms, we present a hybrid differential evolution algorithm combining modified CIPDE (MCIPDE) with modified JADE (MJADE) called CIJADE.  ...  EFFECTIVENESS OF MCIPDE AND MJADE In this subsection, in order to assess the effects of MCIPDE and MJADE, we compare the modified algorithms with original algorithms CIPDE and JADE, respectively.  ... 
doi:10.1109/access.2020.2968119 fatcat:vnwyoncddbdhhd32emnmvgvz7u

Chaotic predator–prey biogeography-based optimization approach for UCAV path planning

Weiren Zhu, Haibin Duan
2014 Aerospace Science and Technology  
Acknowledgements This work was partially supported by Natural Science Foundation of China (NSFC) under grants #61333004, #61273054, and #60975072, National Key Basic Research Program of China  ...  Rahmati et al. developed the migration operators of BBO for searching a solution area of Flexible Job Shop Scheduling (FJSP) problem and introduced BBO algorithm to scheduling area [15] .  ...  BBO algorithm, and can effectively solve the path planning problem of UCAV in complex combat field environment.  ... 
doi:10.1016/j.ast.2013.11.003 fatcat:f6vmeognijbvjpchk7k3qngjaa
« Previous Showing results 1 — 15 out of 1,028 results