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

Weapon-Target Assignment algorithm for Simultaneous and Sequenced Arrival

JOURNAL OF GUIDANCE CONTROL AND DYNAMICS 2018年第11期41卷 2361-2373页

作者： Volle, Kyle Rogers, Jonathan Georgia Inst Technol Sch Mech Engn Atlanta GA 30332 USA

Weapon-target assignment is a multi-agent control problem in which each weapon is assigned to a target to minimize the expected survival value of the targets. In this work, a multi-objective version of the weapon-target assignment problem is considered in which the quality of an assignment is dependent on both the total effectiveness of the weapons assigned to each target and the relative timing of agents' arrival. Such timing constraints may be important in real-world scenarios in which a mission planner wishes to enforce an element of surprise on each target. Building on previous work, a new modified cost function is presented that couples weapon effectiveness and timing metrics into a combined cost. In cases where weapon-target closing speeds are limited to a certain range, this combined cost allows the inclusion of arrival time constraints in the assignment decision process. The performance of this new cost function is demonstrated through theoretical analysis and simulation. Results show that the proposed cost function balances the dual goals of optimizing effectiveness and arrival time considerations under closing speed limitations and that a user-defined tuning parameter can be used to adjust the priority of the dual goals of sequenced arrival and achieving the desired probability of kill.

关键词： Weapon Target Assignment algorithm Weapon Target Assignment branch and bound algorithm Monte Carlo Simulation algorithm Performance Optimization algorithm Mobile Robotic System Damage Assessment Annealing Computing

来源：评论

学校读者我要写书评

暂无评论

Egalitarian peer-to-peer satellite refueling strategy

引用

JOURNAL OF SPACECRAFT AND ROCKETS 2008年第3期45卷 608-618页

作者： Dutta, Atri Tsiotras, Panagiotis Georgia Inst Technol Guggenheim Sch Aerosp Engn Atlanta GA 30332 USA

In this paper we revisit the problem of peer-to-peer refueling of a satellite constellation in orbit with propellant. In particular, we propose the egalitarian peer-to-peer refueling strategy that relaxes the restriction on the active satellites to return to their original orbital slots after all fuel exchanges have been completed. We formulate the problem as a minimum cost flow problem in the so-called constellation network, and minimize the total Delta V subject to flow balance constraints, along with certain additional constraints introduced to avoid conflicts between active and passive satellites. Recognizing that the actual objective is to minimize the total fuel expenditure, instead of Delta V, we also propose a method to improve the results by performing a local search around the minimum-Delta V solution. We also provide explicit upper and lower bounds on the suboptimality of the obtained results. With the help of numerical examples, it is shown that the proposed egalitarian peer-to-peer refueling strategy leads to considerable reduction in terms of the total fuel expenditure over the baseline peer-to-peer strategy.

关键词： Satellite Constellations Constellations Peer to Peer Refueling Propellant Orbital Maneuvers Fuel Consumption Orbital Period branch and bound algorithm Earth Numerical Optimization

来源：评论

学校读者我要写书评

暂无评论

A deterministic global optimization algorithm

引用

APPLIED MATHEMATICS AND COMPUTATION 2007年第1期185卷 382-387页

作者： Ji, Ying Zhang, Ke-Cun Qu, Shao-Han Xian Jiaotong Univ Fac Sci Xian 710049 Peoples R China

In this paper, we consider a deterministic global optimization algorithm for solving a general linear sum of ratios (LFP). First, an equivalent optimization problem (LFP1) of LFP is derived by exploiting the characteristics of the constraints of LFP. By a new linearizing method the linearization relaxation function of the objective function of LFP1 is derived, then the linear relaxation programming (RLP) of LFP1 is constructed and the proposed branch and bound algorithm is convergent to the global minimum through the successive refinement of the linear relaxation of the feasible region of the objection function and the solutions of a series of RLP. And finally the numerical experiments are given to illustrate the feasibility of the proposed algorithm. (c) 2006 Elsevier Inc. All rights reserved.

关键词： general linear sum of ratios linearization relaxation branch and bound algorithm

来源：评论

学校读者我要写书评

暂无评论

One machine scheduling to minimize the maximum earliness with minimum number of tardy jobs

引用

INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS 1998年第2期55卷 213-219页

作者： Guner, E Erol, S Tani, K Gazi Univ Dept Ind Engn TR-06570 Ankara Turkey

In this study we consider the problem of sequencing n jobs on one machine under the dual objective of minimizing the maximum earliness (E-max) with minimum number of tardy jobs (n(T)). A procedure is first proposed to schedule for minimizing the maximum earliness when the set of non-tardy jobs is specified. A branch and bound algorithm is presented to obtain the optimal schedule that minimizes the maximum earliness with minimum number of tardy jobs by connecting Moore's algorithm. (C) 1998 Elsevier Science B.V. All rights reserved.

关键词： production scheduling one machine scheduling secondary-criterion multiple criteria optimization branch and bound algorithm

来源：评论

学校读者我要写书评

暂无评论

Low latency and energy efficient routing tree for wireless sensor networks with multiple mobile sinks

引用

JOURNAL OF NETWORK AND COMPUTER APPLICATIONS 2013年第1期36卷 156-166页

作者： Han, Seung-Wan Jeong, In-Seon Kang, Seung-Ho Natl Inst Math Sci Div Fus & Convergence Math Sci KT Daedeok Res Ctr 2 Taejon 305811 South Korea Elect & Telecommun Res Inst Cyber Secur Convergence Res Lab Taejon 305700 South Korea Natl Acad Agr Sci Genom Div Suwon 441707 South Korea

We propose the minimum Wiener index spanning tree (MWST) as a routing topology that is suitable for sensor networks with multiple mobile base nodes. However, it was proved that finding a spanning tree with the minimum Wiener index from a weighted graph is NP-hard. To address this problem and analyze the effectiveness of the MWST as the routing tree on sensor networks with multiple mobile base nodes, we designed two algorithms: a branch and bound algorithm for small-scale wireless sensor networks and a simulated annealing algorithm for large-scale wireless sensor networks. The simulation results show that MWST outperforms the minimum spanning tree (MST), one of the representative spanning trees used in many routing protocols for sensor networks, in terms of energy efficiency and packet delay. (C) 2012 Elsevier Ltd. All rights reserved.

关键词： Wireless sensor networks Mobile sink Routing tree Wiener index branch and bound algorithm Simulated annealing

来源：评论

学校读者我要写书评

暂无评论

An integrated approach to evaluating assembly-line design alternatives with equipment selection

引用

PRODUCTION PLANNING & CONTROL 2011年第2期22卷 194-206页

作者： Ozdemir, Rifat Gurcan Ayag, Zeki Istanbul Kultur Univ Dept Ind Engn Fac Engn & Architecture Atakoy CampusD-100 Yanyol TR-34156 Istanbul Turkey Kadir Has Univ Dept Ind Engn Fac Engn TR-34083 Istanbul Turkey

The design and implementation of assembly-line systems have been critical issues for companies since the first assembly-line was started at the Ford Highland Plant in 1913. From that time onwards, most companies have met with various problems at the design and implementation stages of assembly-line systems, two of which are the allocation of different work elements to various workstations and the proper equipment selection for workstations. Therefore, in this article, to overcome both the above-mentioned problems, we propose an integrated approach in which a branch and bound algorithm and the analytic hierarchy process (AHP) method are used together. First, the branch and bound algorithm is used to generate a list of assembly-line design alternatives. Then, the generated alternatives are evaluated using the AHP method to determine an optimum solution (the best alternative) at minimum equipment cost. The AHP method is one of the most commonly used multiple-criteria decision-making methods in the literature, and evaluates both qualitative and quantitative evaluation criteria represented in a hierarchical form. The proposed approach is also illustrated on a sample case study.

关键词： assembly-line design assembly-line balancing branch and bound algorithm multiple-criteria decision making analytic hierarchy process

来源：评论

学校读者我要写书评

暂无评论

A heuristic rule for relocating blocks

引用

COMPUTERS & OPERATIONS RESEARCH 2006年第4期33卷 940-954页

作者： Kim, KH Hong, GP Pusan Natl Univ Dept Ind Engn Pusan 609735 South Korea

One of the most important objectives of the storage and pickup operations in block stacking systems is to minimize the number of relocations during the pickup operation. This study suggests two methods for determining the locations of relocated blocks. First, a branch-and-bound (B&B) algorithm is suggested. Next, a decision rule is proposed by using an estimator for an expected number of additional relocations for a stack. The performance of the decision rule was compared with that of the B&B algorithm. (c) 2004 Elsevier Ltd. All rights reserved.

关键词： relocation block stacking branch and bound algorithm heuristic rule

来源：评论

学校读者我要写书评

暂无评论

A Semantics-Based Approach for Speech Annotation of Images

引用

IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING 2011年第9期23卷 1373-1387页

作者： Kalashnikov, Dmitri V. Mehrotra, Sharad Xu, Jie Venkatasubramanian, Nalini Univ Calif Irvine Bren Sch Informat & Comp Sci Dept Comp Sci Irvine CA 92617 USA Univ Calif Irvine Sch Informat & Comp Sci Irvine CA 92617 USA

Associating textual annotations/tags with multimedia content is among the most effective approaches to organize and to support search over digital images and multimedia databases. Despite advances in multimedia analysis, effective tagging remains largely a manual process wherein users add descriptive tags by hand, usually when uploading or browsing the collection, much after the pictures have been taken. This approach, however, is not convenient in all situations or for many applications, e.g., when users would like to publish and share pictures with others in real time. An alternate approach is to instead utilize a speech interface using which users may specify image tags that can be transcribed into textual annotations by employing automated speech recognizers. Such a speech-based approach has all the benefits of human tagging without the cumbersomeness and impracticality typically associated with human tagging in real time. The key challenge in such an approach is the potential low recognition quality of the state-of-the-art recognizers, especially, in noisy environments. In this paper, we explore how semantic knowledge in the form of co-occurrence between image tags can be exploited to boost the quality of speech recognition. We postulate the problem of speech annotation as that of disambiguating among multiple alternatives offered by the recognizer. An empirical evaluation has been conducted over both real speech recognizer's output as well as synthetic data sets. The results demonstrate significant advantages of the proposed approach compared to the recognizer's output under varying conditions.

关键词： Using speech for tagging and annotation using semantics to improve ASR maximum entropy approach correlation-based approach branch and bound algorithm

来源：评论

学校读者我要写书评

暂无评论

Assembly line balancing with station paralleling

引用

COMPUTERS & INDUSTRIAL ENGINEERING 2009年第4期57卷 1218-1225页

作者： Ege, Yunus Azizoglu, Meral Ozdemirel, Nur E. Middle E Tech Univ Dept Ind Engn TR-06531 Ankara Turkey

We consider the NP-hard problem of assembly line balancing with station paralleling. We assume an arbitrary number of parallel workstations can be assigned to each stage. Every task requires a specified tooling/equipment, and this tooling/equipment should be available in all parallel workstations of the stage to which the task is assigned. Our objective is to find an assignment of tasks to stages so as to minimize sum of station opening and tooling/equipment costs. We propose two branch and bound algorithms: one for optimal solutions and one for near optimal solutions. We find that optimal solutions can be found quickly for medium sized problem instances;for larger sized problems we find high quality solutions in reasonable solution times. (C) 2009 Elsevier Ltd. All rights reserved.

关键词： Single model assembly line balancing Station paralleling branch and bound algorithm

来源：评论

学校读者我要写书评

暂无评论

An effective feature selection method for hyperspectral image classification based on genetic algorithm and support vector machine

引用

KNOWLEDGE-BASED SYSTEMS 2011年第1期24卷 40-48页

作者： Li, Shijin Wu, Hao Wan, Dingsheng Zhu, Jiali HoHai Univ Sch Comp & Informat Engn Nanjing 210098 Peoples R China

With the development and popularization of the remote-sensing imaging technology, there are more and more applications of hyperspectral image classification tasks, such as target detection and land cover investigation. It is a very challenging issue of urgent importance to select a minimal and effective subset from those mass of bands. This paper proposed a hybrid feature selection strategy based on genetic algorithm and support vector machine (GA-SVM), which formed a wrapper to search for the best combination of bands with higher classification accuracy. In addition, band grouping based on conditional mutual information between adjacent bands was utilized to counter for the high correlation between the bands and further reduced the computational cost of the genetic algorithm. During the post-processing phase, the branch and bound algorithm was employed to filter out those irrelevant band groups. Experimental results on two benchmark data sets have shown that the proposed approach is very competitive and effective. (C) 2010 Elsevier B.V. All rights reserved.

关键词： Hyperspectral remote sensing Band selection Conditional mutual information Support vector machine Genetic algorithm branch and bound algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：