Filters








13,468 Hits in 5.4 sec

Optimization Control of Front-End Speed Regulation (FESR) Wind Turbine Based on Improved NSGA-II

Li Xiaoqing, Dong Haiying, Li Hongwei, Li Mingxue, Sun Zhiqiang
2019 IEEE Access  
And pitch angle and vane opening angle were optimized by the improved NSGA-II algorithm. Afterward, the optimization control algorithm has been validated through simulation experiment to a 2 MW FESR.  ...  Therefore, it is feasible and effective to optimize the control of FESR by the improved NSGA-II algorithm proposed in this paper.  ...  Currently, there are two common ways to find a satisfactory solution.  ... 
doi:10.1109/access.2019.2908995 fatcat:anstaho5yfgtlg7kzd5xgrfnda

Anytime merging of appearance based maps

Gorkem Erinc, Stefano Carpin
2012 2012 IEEE International Conference on Robotics and Automation  
Due to the lack of accepted metrics to evaluate the quality of merged appearance-based maps, we propose to use algebraic connectivity for this purpose, and we discuss why this is an appropriate measure  ...  Next, we introduce QuickConnect, an anytime algorithm aiming to maximize the given metric and we show how it can merge couple of maps, as well as multiple maps at the same time.  ...  Therefore, E * c is optimal when algebraic connectivity is the considered metric. Finally, algebraic connectivity is related to the sparsity of cuts in the graph.  ... 
doi:10.1109/icra.2012.6225131 dblp:conf/icra/ErincC12 fatcat:g5uiihes3bg4peur5tddftcyla

Path Planning of Mobile Robot Based on an Improved Genetic Algorithm

Zhang Yi, Dai En-can, Ren Tong-hui
2016 DEStech Transactions on Engineering and Technology Research  
Among them, the improved genetic algorithm to search the optimal path gets to 95 times, and the shortest path is 20.9706. Besides, the average searching time takes up 217ms.  ...  While the number of traditional method to search for the optimal path reaches up to 62 times, the shortest path can be 25.0711, and the average searching time needs 345ms.  ...  Compare of the improved and the traditional genetic algorithm in optimal fitness function and converging algebra.  ... 
doi:10.12783/dtetr/icmite20162016/4633 fatcat:vzhkg6rpmze6rg6idaznqizuxy

A General Robot Inverse Kinematics Solution Method Based on Improved PSO Algorithm

Liu Yiyang, Xi Jiali, Bai Hongfei, Wang Zhining, Sun Liangliang
2021 IEEE Access  
To solve this problem, this paper proposes an inverse kinematics calculation method based on improved particle swarm optimization (PSO) algorithm and applicable to general robots.  ...  time, and the immigration operator is proposed to increase the diversity of the particle population in the iteration.  ...  Various particle swarms are connected through immigration operator [22] to realize the co-evolution of multi-particle swarms; the optimal individuals in each evolutionary generation of various swarms  ... 
doi:10.1109/access.2021.3059714 fatcat:cosyd6nn3rd7var47hjq2i4fee

A Survey of Change Detection Methods Based on Remote Sensing Images for Multi-Source and Multi-Objective Scenarios

Yanan You, Jingyi Cao, Wenli Zhou
2020 Remote Sensing  
However, diverse multi-source features and change patterns bring challenges to the change detection in urban cases.  ...  On this basis, not only the evolution process and relationship of the representative solutions are elaborated in the module description, through emphasizing the feasibility of fusing diverse data and the  ...  Acknowledgments: Thanks to the guidance of Intelligent Perception and Computing Teaching and Research Office in BUPT, and thanks to the editors for their suggestions for this article.  ... 
doi:10.3390/rs12152460 fatcat:itc5ixwgrffuzgzyj2yrycaree

Network Coding Theory: A Survey

Riccardo Bassoli, Hugo Marques, Jonathan Rodriguez, Kenneth W. Shum, Rahim Tafazolli
2013 IEEE Communications Surveys and Tutorials  
Next, in some scenarios, scalar linear network coding is not enough to solve the network and non-linear network coding is necessary; actually, vector network coding represents a way to achieve solvability  ...  This article surveys all known fields of network coding theory and leads the reader through the antecedents of the network coding theory to the most recent results, considering also information theory  ...  In 1997, [29] studied the optimality of the principle of superposition by considering two-and three-level diversity coding with three encoders, to find that this method is optimal in the 86 percent of  ... 
doi:10.1109/surv.2013.013013.00104 fatcat:jgnf4i7rczfqrcyv7tygrydtxm

Study on Query Optimization based Techniques using Stochastic Approaches

Daljinder Dugg, Mandeep Singh, Gurpreet Singh
2017 International Journal of Computer Applications  
The overall objective of this paper is to represent the various query optimization techniques using stochastic approaches which further optimize the design of query optimization genetic approaches.  ...  A number of heuristics have been applied in recent times, which proposed new algorithms for substantially improving the performance of a query. The hunt for a better solution still continues.  ...  For finding an optimal operation site allocation plan, first of all, a 'SQL' based decision support system query is decomposed into relational algebra expressions (suboperations) based on 'selection',  ... 
doi:10.5120/ijca2017913482 fatcat:lhwgfelmibebjdtfzpdfcqb3tu

Maximizing the algebraic connectivity in multilayer networks with arbitrary interconnections [article]

Ali Tavasoli, Ehsan Ardjmand, Heman Shakeri
2020 arXiv   pre-print
We use the ratio of algebraic connectivity and the layer sizes to explain the results.  ...  Allowing arbitrary interconnections entails regions of multiple transitions, giving more diverse diffusion phases with respect to one-to-one interconnection case.  ...  However, here, due to multiple structural transitions, we note more diverse optimal diffusion phases.  ... 
arXiv:2008.13036v1 fatcat:bxxxfgnrsfahjfh52nqw3k2vme

Optimization Algorithm for Route Selection based on Intelligent Optimization

Wang Aiju, Shao Hua
2015 Open Automation and Control Systems Journal  
Because it is easy for the simulated annealing (SA) algorithm to jump out of local optimal solutions, to solve this problem, this paper presents the ORS-SAGEP algorithm accordingly, which can better solve  ...  single GEP's problems of poor optimization accuracy and easily falling into local optimum.  ...  In the industry, there are mainly two ways for QoS route selection optimization: control through nodes, and control through local or entire network.  ... 
doi:10.2174/1874444301507010314 fatcat:pu76xkvojjc6jp7bkque3mg7ri

A-Teams: An Agent Architecture for Optimization and Decision-Support [chapter]

John Rachlin, Richard Goodwin, Sesh Murthy, Rama Akkiraju, Fred Wu, Santhosh Kumaran, Raja Das
1999 Lecture Notes in Computer Science  
Through sharing of the population of solutions, cooperative behavior between agents emerges and tends to result in better solutions than any one agent could produce.  ...  In this paper, we describe an agent architecture, A-Teams, that we have successfully used to develop real-world optimization and decision support applications.  ...  A-Teams are useful for multi-objective optimization and decisionsupport because a set of agents can embody many different objectives and are more readily able to produce a diverse set of solution alternatives  ... 
doi:10.1007/3-540-49057-4_17 fatcat:xcd33ccernavpaf4etpnbocwmi

Extending Relational Query Processing with ML Inference [article]

Konstantinos Karanasos, Matteo Interlandi, Doris Xin, Fotis Psallidas, Rathijit Sen, Kwanghyun Park, Ivan Popivanov, Supun Nakandal, Subru Krishnan, Markus Weimer, Yuan Yu, Raghu Ramakrishnan, Carlo Curino
2019 arXiv   pre-print
Our initial evaluation on real data demonstrates performance gains of up to 5.5x from the native integration of ML in SQL Server, and up to 24x from cross-optimizations--we will demonstrate Raven live  ...  ., ONNX Runtime) deep within SQL Server, and a unified intermediate representation (IR) to enable advanced cross-optimizations between ML and DB operators.  ...  We purposely allow diverse operator levels to unlock different optimizations, similar to MLIR [23] .  ... 
arXiv:1911.00231v1 fatcat:coqmnmzql5g4jpg5qcag6mafxa

Tensor Computing for Internet of Things (Dagstuhl Perspectives Workshop 16152)

Avrim Acar, Animashree Anandkumar, Lenore Mullin, Sebnem Rusitschka, Volker Tresp, Marc Herbstritt
2016 Dagstuhl Reports  
In an interactive three-day workshop industrial and academic researchers exchanged their multidisciplinary perspectives through impulse talks, panel discussions, and break-out sessions.  ...  On the other hand, IoT/CPS have characteristics that make tensor methods applicable to extract information very efficiently.  ...  Further, we have established that tensor methods are guaranteed to find the globally optimal solution to other challenging non-convex problems such as training multi-layer neural networks and reinforcement  ... 
doi:10.4230/dagrep.6.4.57 dblp:journals/dagstuhl-reports/AcarAMRT16 fatcat:psomri4q4faapbjc4dot7ca3em

Hybrid Solution Methodology: Heuristic-Metaheuristic-Implicit Enumeration 1-0 for the Capacitated Vehicle Routing Problem (Cvrp)

David Escobar, Ramón A., Antonio Escobar
2016 International Journal of Advanced Computer Science and Applications  
We present a hybrid methodology approach to solve this problem which incorporates an improvement stage by using a 1-0 implicit enumeration technique or Balas's method.  ...  The capacitated vehicle routing problem (CVRP) is a difficult combinatorial optimization problem that has been intensively studied in the last few decades.  ...  In this way, it is possible to add diversity to the population and avoid being trapped in local optima prematurely.  ... 
doi:10.14569/ijacsa.2016.070338 fatcat:r7dlegq6hjemzaluha2xazbtqi

Multicasting in cognitive radio networks: Algorithms, techniques and protocols

Junaid Qadir, Adeel Baig, Asad Ali, Quratulain Shafi
2014 Journal of Network and Computer Applications  
A prime application of CRNs is dynamic spectrum access (DSA), which improves the efficiency of spectrum allocation by allowing a secondary network, comprising of secondary users (SUs), to share spectrum  ...  Various approaches, including those based in optimization theory, network coding, algorithms, have been proposed for performing efficient multicast in CRNs.  ...  Using this principle, the optimal policy can be computed through backward induction starting at the terminal point.  ... 
doi:10.1016/j.jnca.2014.07.024 fatcat:xkjekyopd5fg5am3dhop36nadi

:{unav)

Howie Choset
2012 Annals of Mathematics and Artificial Intelligence  
The final section describes some provably complete multi-robot coverage algorithms.  ...  It is our conjecture that most complete algorithms use an exact cellular decomposition, either explicitly or implicitly, to achieve coverage.  ...  gratefully acknowledges Ercan Acar, Israel Wagner, Elon Rimon, Wes Huang, Zack Butler, Susan Hert, Alex Zelinsky, Tucker Balch, Jon Luntz, Mark Bedillion and the anonymous reviewers for their contributions to  ... 
doi:10.1023/a:1016639210559 fatcat:nzuf4d4ftrgfpcv5lmy6yiemyi
« Previous Showing results 1 — 15 out of 13,468 results