检索结果-内蒙古大学图书馆

IEEE International Conference on Evolutionary Computation

作者： Ciesielski, V Scerri, P RMIT Univ Dept Comp Sci Melbourne Vic Australia

ISBN: (纸本)0780348699

Evolutionary approaches are not usually considered for real time scheduling problems due to long computation times and uncertainty about the length of the computation time. We argue that for some kinds of problems, such as optimizing aircraft landing times, genetic algorithms have advantages over other methods as a best solution is always available when needed, and, since the computation is inherently parallel, more processors can be added to get higher quality solutions if necessary. Furthermore, the computation time can be decreased and the quality of the generated schedules increased by seeding the genetic algorithm from a previous population. We have performed a series of experiments on landing data for Sydney airport on the busiest day of the year. Our results show that high quality solutions can be computed in the time window between aircraft landings.

关键词： genetic algorithms scheduling evolutionary algorithms optimization anytime algorithm

来源：评论

学校读者我要写书评

暂无评论

Way Point Based Deliberative Path Planner for Navigation

Way Point Based Deliberative Path Planner for Navigation

引用

International Conference on Materials Science and Information Technology (MSIT 2011)

作者： Lilla, A. Daleel Ragavan, S. Veera Ponnambalam, S. G. Monash Univ Sch Engn Bandar Sunway Malaysia

ISBN: (纸本)9783037853191

We present an Evolutionary Planning and Replanning algorithm, capable of producing Bounded Suboptimal solutions in an anytime fashion. Combining Genetic algorithm with anytime approach is uncommon. anytime Genetic algorithm combines the benefits of an anytime and an Evolutionary algorithm to efficiently provide solutions to complex, Dynamic Search Problems. The results appear promising for shorter horizon problems, while for large horizon the search tends to behave like a standard GA.

关键词： Robot Navigation Multi-Objective Shortest Path Problem Path Planning Problem A* Dynamic Search Genetic algorithms anytime algorithm Contract anytime GA(CAGA) Interruptible anytime GA (IAGA)

来源：评论

学校读者我要写书评

暂无评论

Preliminary considerations in the design of a sensor for improving the reference trajectory calculation for the individual leg of a hexapod 16

Preliminary considerations in the design of a sensor for imp...

引用

IEEE 16th International Symposium on Intelligent Systems and Informatics (SISY)

作者： Gobor, Zoltan Odry, Peter Varkonyi-Koczy, Annamaria R. Obuda Univ Doctoral Sch Appl Informat & Appl Math Budapest Hungary Univ Dunaujvaros Dept Control Engn & Informat Technol Dunaujvaros Hungary Obuda Univ Inst Automat Budapest Hungary

ISBN: (纸本)9781538668412

The free-climbing robots are the alternative to wheeled vehicles, because the legged locomotion allows mobility on the steep gradients under the harsh environmental conditions. The steady progression requires coordination of leg movements for which the force sensors implemented in the joints of the robot legs are not always sufficient. Considering the previous developments in the field of robotics, the combination of the impedance and vision sensors comprises an obvious solution for providing stable and accurate contact between the individual legs and the ground. The implementation of additional, non-invasive sensor/s on all the legs of the hexapod robotic platform, for the indirect measuring and analysis of the terrain surface, is investigated. Furthermore, a method for the parametric 3D modeling of simulation assemblies is described in a mixed top-down, bottom-up and middle-out design approach. Mechanisms were created using the common origin skeletal modeling (top-down approach), allowing the context analysis and the definition of the parameters for the further numerical optimization in an early phase of the development. Finally, the applicability of the anytime approach during the optimization of the mechanical parts of the mechanism in the design process was tested.

关键词： hexapod parametric modeling common origin skeletal modeling anytime algorithm kinematical simulation

来源：评论

学校读者我要写书评

暂无评论

anytime Hybrid Best-First Search with Tree Decomposition for Weighted CSP 21st

Anytime Hybrid Best-First Search with Tree Decomposition for...

引用

31st International Conference on Logic Programming (ICLP) Co-located with the 21st International Conference on Principles and Practice of Constraint Programming (CP)

作者： Allouche, David de Givry, Simon Katsirelos, George Schiex, Thomas Zytnicki, Matthias INRA MIAT UR 875 F-31320 Castanet Tolosan France

ISBN: (纸本)9783319232195;9783319232188

We propose Hybrid Best-First Search (HBFS), a search strategy for optimization problems that combines Best-First Search (BFS) and Depth-First Search (DFS). Like BFS, HBFS provides an anytime global lower bound on the optimum, while also providing anytime upper bounds, like DFS. Hence, it provides feedback on the progress of search and solution quality in the form of an optimality gap. In addition, it exhibits highly dynamic behavior that allows it to perform on par with methods like limited discrepancy search and frequent restarting in terms of quickly finding good solutions. We also use the lower bounds reported by HBFS in problems with small treewidth, by integrating it into Backtracking with Tree Decomposition (BTD). BTD-HBFS exploits the lower bounds reported by HBFS in individual clusters to improve the anytime behavior and global pruning lower bound of BTD. In an extensive empirical evaluation on optimization problems from a variety of application domains, we show that both HBFS and BTD-HBFS improve both anytime and overall performance compared to their counterparts.

关键词： Combinatorial optimization anytime algorithm Weighted constraint satisfaction problem Cost function networks Best-first search Tree decomposition

来源：评论

学校读者我要写书评

暂无评论

Agents in electronic commerce: Component technologies for automated negotiation and coalition formation

Agents in electronic commerce: Component technologies for au...

引用

3rd International Conference on Multi-Agent Systems (ICMAS'98)

作者： Sandholm, T Washington Univ Dept Comp Sci St Louis MO 63130 USA

ISBN: (纸本)081868500X

Automated negotiation and coalition formation among self-interested agents are playing an increasingly important role in electronic commerce. Such agents cannot be coordinated by externally imposing their strategies. Instead the interaction protocols have to be designed so that each agent is motivated to follow the strategy that the protocol designer wants it to follow. This paper reviews six component technologies that we have developed for making such interactions less manipulable and more efficient in terms of the computational processes and the outcomes: 1. OCSM-contracts in marginal cost based contracting, 2. leveled commitment contracts, 3. anytime coalition structure generation with worst case guarantees, 4. trading off computation cost against optimization quality within each coalition, 5. distributing search among insincere agents, and 6. unenforced contract execution. Each of these technologies represents a different way of battling self-interest and combinatorial complexity simultaneously. This is a key battle when multi-agent systems move into large-scale open settings.

关键词： multiagent systems electronic commerce negotiation contracting coalition formation game theory anytime algorithm resource-bounded reasoning

来源：评论

学校读者我要写书评

暂无评论

Variable neighborhood search for graphical model energy minimization

引用

ARTIFICIAL INTELLIGENCE 2020年 278卷 103194-000页

作者： Ouali, Abdelkader Allouche, David de Givry, Simon Loudni, Samir Lebbah, Yahia Loukil, Lakhdar Boizumault, Patrice Univ Caen Normandy CNRS UMR 6072 GREYC F-14032 Caen France INRA MIA Toulouse UR 875 F-31320 Castanet Tolosan France Univ Oran1 Lab LITIO Oran 31000 Algeria

Graphical models factorize a global probability distribution/energy function as the product/sum of local functions. A major inference task, known as MAP in Markov Random Fields and MPE in Bayesian Networks, is to find a global assignment of all the variables with maximum a posteriori probability/minimum energy. A usual distinction on MAP solving methods is complete/incomplete, i.e. the ability to prove optimality or not. Most complete methods rely on tree search, while incomplete methods rely on local search. Among them, we study Variable Neighborhood Search (vNS) for graphical models. In this paper, we propose an iterative approach above VNS that uses (partial) tree search inside its local neighborhood exploration. The proposed approach performs several neighborhood explorations of increasing search complexity, by controlling two parameters, the discrepancy limit and the neighborhood size. Thus, optimality of the obtained solutions can be proven when the neighborhood size is maximal and with unbounded tree search. We further propose a parallel version of our method improving its anytime behavior on difficult instances coming from a large graphical model benchmark. Last we experiment on the challenging minimum energy problem found in Computational Protein Design, showing the practical benefit of our parallel version. A solver is available at https://***/toulbar2/toulbar2. (C) 2019 Elsevier B.V. All rights reserved.

关键词： Variable neighborhood search Computational Protein Design Parallelism Complete search method anytime algorithm Discrete graphical model Combinatorial optimization Markov Random Field Most Probable Explanation Cost Function Network

来源：评论

学校读者我要写书评

暂无评论

algorithms for partially robust team formation

引用

AUTONOMOUS AGENTS AND MULTI-AGENT SYSTEMS 2023年第2期37卷 22-22页

作者： Schwind, Nicolas Demirovic, Emir Inoue, Katsumi Lagniez, Jean-Marie Natl Inst Adv Ind Sci & Technol Tokyo Japan Delft Univ Technol Delft Netherlands Natl Inst Informat Tokyo Japan SOKENDAI Grad Univ Adv Studies Tokyo Japan Univ Artois CNRS CRIL UMR8188 Rue Jean Souvraz F-62307 Lens France

In one of its simplest forms, Team Formation involves deploying the least expensive team of agents while covering a set of skills. While current algorithms are reasonably successful in computing the best teams, the resilience to change of such solutions remains an important concern: Once a team has been formed, some of the agents considered at start may be finally defective and some skills may become uncovered. Two recently introduced solution concepts deal with this issue proactively: 1) form a team which is robust to changes so that after some agent losses, all skills remain covered, and 2) opt for a recoverable team, i.e., it can be "repaired" in the worst case by hiring new agents while keeping the overall deployment cost minimal. In this paper, we introduce the problem of partially robust team formation (PR-TF). Partial robustness is a weaker form of robustness which guarantees a certain degree of skill coverage after some agents are lost. We analyze the computational complexity of PR-TF and provide two complete algorithms for it. We compare the performance of our algorithms with the existing methods for robust and recoverable team formation on several existing and newly introduced benchmarks. Our empirical study demonstrates that partial robustness offers an interesting trade-off between (full) robustness and recoverability in terms of computational efficiency, skill coverage guaranteed after agent losses and repairability. This paper is an extended and revised version of as reported by (Schwind et al., Proceedings of the 20th International Conference on Autonomous Agents and Multiagent Systems (AAMAS'21), pp. 1154-1162, 2021).

关键词： Team formation Robustness Partial robustness Resilience Facility location Computational complexity anytime algorithm

来源：评论

学校读者我要写书评

暂无评论

Informed anytime Bi-directional Fast Marching Tree for optimal motion planning in complex cluttered environments

引用

EXPERT SYSTEMS WITH APPLICATIONS 2023年 215卷

作者： Wang, Kuan Xu, Jing Song, Kechen Yan, Yunhui Peng, Yihang Northeastern Univ Sch Mech Engn & Automat Shenyang 110819 Peoples R China Peoples Liberat Army China PLA Troops 91479 65 Qingbi Tou Rd Zhoushan City Zhejiang Peoples R China Shenyang Univ Technol Sch Mech Engn Shenyang 110870 Liaoning Peoples R China

Practical applications favor anytime asymptotically-optimal algorithms that find a feasible solution and improve it toward the optimal solution within limited time. This paper proposed Informed anytime Bi-directional Fast Marching Tree (IABFMT*), an anytime asymptotically-optimal sampling-based algorithm that combines the strength of BFMT* (bi-directional variant of FMT*) and IAFMT* (an anytime variant of FMT*). IABFMT* per-forms a bi-directional "lazy" search to efficiently find a feasible solution and quickly improve it towards optimal. In addition, we implemented a graph pruning method to simplify the planning problem and heuristic cost evaluation to reject samples, which avoided a lot of unnecessary computations and improved the convergence rate. Different simulations in OMPL have been carried out to demonstrate the superior efficiency of IABFMT* in comparison with other state-of-the-art algorithms in complex cluttered environments.

关键词： Fast Marching Tree anytime algorithm Bi-directional search Motion planning

来源：评论

学校读者我要写书评

暂无评论

Towards a Real Time Distributed Flood Early Warning System

引用

INTERNATIONAL JOURNAL OF ADVANCED COMPUTER SCIENCE AND APPLICATIONS 2021年第1期12卷 535-548页

作者： Marouane, El Mabrouk CA GIP CA Versailles France

Since the beginning of humanity, floods have caused a lot of damages and have killed many people. So far, floods are causing a lot of losses and damage in many countries every year. When facing such a disaster, effective decisions regarding flood management must be made using real-time data, which must be analyzed and, more importantly, controlled. In this paper, we present a distributed decision support system that can be deployed to support flood management decision makers. Our system is based on Multi-Agent Systems and anytime algorithm, and it has two modes of processing: a Pre-Processing mode to test and control the information sent by sensors in real-time and the Main Processing mode, which has three different parts. The first part is the Trigger Mode for monitoring rainfall and triggering the second part, the offline mode, which predicts the flood based on historical data without going through the rea-ltime decision support system. Finally, the online mode predicts the flood based on real-time data and on a combination of communications among different modules, hydrodynamic data, Geographic Information System (GIS), decision support and a remote sensing module to determine information about the flood.

关键词： Flood forecasting distributed decision support system multi-agent system anytime algorithm

来源：评论

学校读者我要写书评

暂无评论

Greedy recursive spectral bisection for modularity-bound hierarchical divisive community detection

引用

STATISTICS AND COMPUTING 2024年第4期34卷 145-145页

作者： Cardoso, Douglas O. da Silva Junior, Joao Domingos Gomes Oliveira, Carla Silva Marques, Celso de Assis, Laura Silva Univ Porto Fac Arts & Humanities Ctr Linguist Via Panoram Edgar Cardoso s-n P-4150564 Porto Portugal Celso Suckow Fonseca Fed Ctr Technol Educ Gen Canabarro St 485 BR-20271204 Rio De Janeiro RJ Brazil Natl Sch Stat Sci ENCE Andre Cavalcanti St 106 BR-20231050 Rio De Janeiro RJ Brazil Polytech Inst Tomar Smart Cities Res Ctr Quinta Contador P-2300313 Santarem Portugal

Spectral clustering techniques depend on the eigenstructure of a similarity matrix to assign data points to clusters, so that points within the same cluster exhibit high similarity and are compared to those in different clusters. This work aimed to develop a spectral method that could be compared to clustering algorithms that represent the current state of the art. This investigation conceived a novel spectral clustering method, as well as five policies that guide its execution, based on spectral graph theory and embodying hierarchical clustering principles. Computational experiments comparing the proposed method with six state-of-the-art algorithms were undertaken in this study to evaluate the clustering methods under scrutiny. The assessment was performed using two evaluation metrics, specifically the adjusted Rand index, and modularity. The obtained results furnish compelling evidence, indicating that the proposed method is competitive and possesses distinctive properties compared to those elucidated in the existing literature. This suggests that our approach stands as a viable alternative, offering a robust choice within the spectrum of available same-purpose tools.

关键词： Spectral clustering Hierarchical clustering anytime algorithm Adjusted Rand index Modularity

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：