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

planning algorithms algorithms for in-situ production of free-form concrete panels

AUTOMATION IN CONSTRUCTION 2018年第Jul.期91卷 83-91页

作者： Son, Seunghyun Lim, Jeeyoung Kim, Sunkuk Kyung Hee Univ Dept Architectural Engn Suwon South Korea

Various materials are used when fabricating free-form panels, including glass, aluminum, titanium, and glass fiber reinforced concrete (GFRC), in addition to steel and concrete. Concrete has excellent structural stability, constructability, and economic efficiency, as well as the advantages of shape, thickness, forming of the finished surface and homogeneity of material. As a result, fast, low-cost technology has been developed to ensure the quality of free-form concrete panels (FCPs). FCPs, like precast concrete members, are generally constructed during in-plant production, on-site transportation, and installation. However, if FCPs are produced in site, cost savings of approximately 20% can be achieved due to savings in transportation and overhead at plants. In order to produce and install FCPs in site with restricted time and area, it is necessary to analyze and systematically link the related processes and influence factors. The purpose of this study is to develop planning algorithms for the in situ production of free-form concrete panels. For this study, the relationship between the factors affecting the production plan of FCPs was mathematically established. The algorithms proposed in this study support the quick and easy establishment of in-situ production plans, contributing to cost reduction, according to various influencing factors such as the number of CNC machines, number of production cycles, production time, production area, and lead time.

关键词： Free-form Concrete panel In-situ production planning algorithms Cost reduction

来源：评论

学校读者我要写书评

暂无评论

DIS planning algorithms Evaluation

DIS Planning Algorithms Evaluation

引用

IEEE Consumer Communications and Networking Conference (CCNC)

作者： El Rhalibi, Abdennour Goudoulakis, Efstathios Merabti, Madjid Liverpool John Moores Univ Sch Comp & Math Sci Liverpool L3 3AF Merseyside England

ISBN: (纸本)9781457720710

Digital Interactive Storytelling (DIS) is a relatively new field of interactive computer entertainment which aims at creating interactive applications capable of generating consistent and rich narratives. planning systems are the most widely used techniques for DIS, however there have not been much novel solutions for DIS research with respect to developing new planning algorithms. Not only no DIS dedicated planning algorithm has been proposed, but when general-purpose AI planning algorithms are being used in DIS, the justification of the algorithm's choice is usually inadequate. In this paper we propose an evaluation of planning algorithms for DIS and discuss the results in the context of related works.

关键词： component DIS planning algorithms

来源：评论

学校读者我要写书评

暂无评论

Dynamic Composition of Semantically Annotated Web Services through QoS-aware HTN planning algorithms

Dynamic Composition of Semantically Annotated Web Services t...

引用

4th International Conference on Internet and Web Applications and Services

作者： Hristoskova, Anna Volckaert, Bruno De Turck, Filip Univ Ghent Dept Informat Technol IBBT B-9050 Ghent Belgium

ISBN: (纸本)9781424438518

This paper presents a Dynamic Composer for Web services. The services are enriched with semantic descriptions in OWL-S, based on which the Composer automatically creates a combination of services reaching a specified goal. As an example, a trip planning use case is chosen where the goal ranges from booking of a single flight to planning of an entire trip including flight, hotel, transport, etc. The composition is achieved using local and global algorithms satisfying specific quality of service (QoS) constraints and requirements such as the execution time or cost of the invoked Web services. At the same time a more extended HTN planning algorithm is discussed, matching not only service outputs to inputs but also satisfying service preconditions through effects. In addition to the automatic composition, the paper also proposes a recovery mechanism in case of unavailable services. When executing the composition of flight services, unavailable services are dynamically replaced by equivalent services or a new composition achieving the needed result. The presented platform and planning algorithms are put through extensive performance and scalability tests for typical trip booking scenarios, in which basic services are composed to a complex trip planning service.

关键词： dynamic composition planning algorithms QoS OWL-S Semantic Web

来源：评论

学校读者我要写书评

暂无评论

Green cloud environment by using robust planning algorithm

引用

EGYPTIAN INFORMATICS JOURNAL 2017年第3期18卷 205-214页

作者： Thaman, Jyoti Singh, Manpreet MM Univ Ambala Haryana India MM Univ Sadopur Ambala India

Cloud computing provided a framework for seamless access to resources through network. Access to resources is quantified through SLA between service providers and users. Service provider tries to best exploit their resources and reduce idle times of the resources. Growing energy concerns further makes the life of service providers miserable. User's requests are served by allocating users tasks to resources in Clouds and Grid environment through scheduling algorithms and planning algorithms. With only few planning algorithms in existence rarely planning and scheduling algorithms are differentiated. This paper proposes a robust hybrid planning algorithm, Robust Heterogeneous-Earliest-Finish-Time (RHEFT)(1) for binding tasks to VMs. The allocation of tasks to VMs is based on a novel task matching algorithm called Interior Scheduling. The consistent performance of proposed RHEFT algorithm is compared with Heterogeneous-Earliest-Finish-Time (HEFT)(2) and Distributed HEFT (DHEFT)(3) for various parameters like utilization ratio, makespan, Speed-up and Energy Consumption. RHEFT's consistent performance against HEFT and DHEFT has established the robustness of the hybrid planning algorithm through rigorous simulations. (C) 2017 Production and hosting by Elsevier B.V. on behalf of Faculty of Computers and Information, Cairo University. This is an open access article under the CC BY-NC-ND license.

关键词： planning algorithms Scheduling algorithms Ready wueue Robust Cloud computing

来源：评论

学校读者我要写书评

暂无评论

A ROC-Based Approach for Developing Optima Strategies in UUV Search planning

引用

IEEE JOURNAL OF OCEANIC ENGINEERING 2018年第4期43卷 843-855页

作者： Baylog, John G. Wettergren, Thomas A. Naval Undersea Warfare Ctr Newport RI 02841 USA

This paper addresses the high-level search planning that is necessary to find hidden objects in difficult undersea environments where sensor performance varies geographically and the susceptibility to false alarms is high. We develop a game-theoretic approach for maximizing the information that is collected as a multiagent collaborative search is conducted over a region of interest. To accomplish this, we apply 1) a search channel formalism to the discrete search modeling paradigm to develop information measures as a function of searcher regional visitation;and 2) a receiver operator characteristic analysis to map sensor detection characteristics to search events. We formulate an area search game where player action directs where and how information is collected under a fixed cost constraint on search effort. We discuss the properties of the information measure developed for a repeated look over the area search channel and examine the impact of setting ROC operating points to their game equilibrium values. We describe a new algorithmic capability for solving the search allocation problem where searchers can collaborate in their efforts to resolve false alarm outcomes. Results are presented to show the dominance of this approach over alternative strategies allotted to the game and to demonstrate the capability of exploiting the known nonhomogeneity in the search environment.

关键词： Information gain optimization planning algorithms ROC curves search games unmanned vehicles

来源：评论

学校读者我要写书评

暂无评论

Multi-objective optimisation for heterogeneous cellular network planning

引用

IET COMMUNICATIONS 2019年第3期13卷 322-330页

作者： Tseng, Fan-Hsun Chen, Chi-Yuan Chao, Han-Chieh Natl Taiwan Normal Univ Dept Technol Applicat & Human Resource Dev Taipei Taiwan Natl Ilan Univ Dept Comp Sci & Informat Engn Yilan Taiwan Natl Dong Hwa Univ Dept Elect Engn Hualien Taiwan

Small cell aims at improving the cell coverage and capacity of macrocell. Network operators investigate cell planning for improving system performance and for satisfying user requirements with minimal construction cost and least unserved users. Most of the existing literature merely considered a single objective function or investigated cell planning for small-scale and homogeneous networks. This study aims to optimise multiple objective functions of a large-scale and heterogeneous wireless network with multiple macrocells and multiple small cells. The authors formulate the multi-objective optimisation problem of cell planning for heterogeneous cellular networks. The three objects include construction cost, number of unserved users and network capacity. Then they propose the large-scale cell planning genetic algorithm (LSCPGA) to find a planning result with the lowest fitness value. Simulation results show that LSCPGA economises 9-20% construction cost, eliminates the number of unserved users from 4 to 10% and enhances 2-15% in network capacity compared to other planning algorithms.

关键词： telecommunication network planning cellular radio optimisation genetic algorithms system performance satisfying user requirements minimal construction cost unserved users single objective function investigated cell planning homogeneous networks multiple objective functions heterogeneous wireless network multiple macrocells multiple small cells multiobjective optimisation problem heterogeneous cellular networks network capacity large-scale cell planning result 9-20% construction cost planning algorithms heterogeneous cellular network planning cell coverage network operators

来源：评论

学校读者我要写书评

暂无评论

The 1998 AI planning Systems Competition

引用

AI MAGAZINE 2000年第2期21卷 35-55页

作者： McDermott, D Yale Univ New Haven CT 06520 USA

The 1998 planning Competition at the AI planning Systems Conference was the first of its kind. Its goal was to create planning domains that a wide variety of planning researchers could agree on to make comparison among planners more meaningful, measure overall progress in the field, and set up a framework for long-term creation of a repository of problems in a standard notation. A rules committee for the competition was created in 1997 and had long discussions on how the contest should go. One result of these discussions was the pddl notation for planning domains. This notation was used to set up a set of planning problems and get a modest problem repository started. As a result, five planning systems were able to compete when the contest took place in June 1998. All these systems solved problems in the strips framework, with some slight extensions. The attempt to find domains for other forms of planning foundered because of technical and organizational problems. in spite of this problem, the competition achieved its goals partially in that it confirmed that substantial progress had occurred in some subfields of planning, and it allowed qualitative comparison among different planning algorithms. II is urged that the competition continue to take place and to evolve.

关键词： .notation contest planning problems competitions planning algorithms AI planning pddl planning Competition

来源：评论

学校读者我要写书评

暂无评论

SEMPA - A Semantic Business Process Management Approach for the planning of Process Models

引用

WIRTSCHAFTSINFORMATIK 2008年第6期50卷 445-460页

作者： Heinrich, Bernd Bewernik, Marc-Andre Henneberger, Matthias Krammer, Alexander Lautenbacher, Florian Univ Augsburg Lehrstuhl BWL Wirtschafts Informat Informat & Fin D-86135 Augsburg Germany Univ Augsburg Programmierung verteilter Syst Lab D-86135 Augsburg Germany

Currently process modeling is mostly done manually. Therefore, the initial design of process models as well as changes to process models which are frequently necessary to react to new market developments or new regulations are time-consuming tasks. In this paper we introduce SEMPA, an approach for the partly automatic planning of process models. Using ontologies to semantically describe actions - as envisioned in Semantic Business Process Management -, a process model for a specified problem setting can be created automatically. In comparison to existing planning algorithms our approach creates process models including control structures and is able to cope with complex and numerical input and output parameters of actions. The prototypical implementation as well as an example taken from the financial services domain illustrate the practical benefit of our approach.

关键词： semantic business process management planning of process models planning algorithms

来源：评论

学校读者我要写书评

暂无评论

Concurrent Test planning 41

Concurrent Test Planning

引用

International Test Conference 2010

作者： Van Wagenen, Bethany Seng, Edward Teradyne Inc N Reading MA 01864 USA

Testing multiple device functions in parallel can yield significant test time and cost of test reductions. This paper discusses the planning process and algorithms required to realize an efficient and achievable concu... 详细信息

ISBN: (纸本)9781424472055

关键词： automatic test equipment automatic test equipment automatic test pattern generation automatic test software concurrent test planning multiple device functions parallel planning algorithms planning process test reductions test time

来源：评论

学校读者我要写书评

暂无评论

Optimal Vehicle planning and the Search Tour Problem 18

Optimal Vehicle Planning and the Search Tour Problem

引用

Conference on Unmanned Systems Technology XVIII

作者： Wettergren, Thomas A. Bays, Matthew J. Naval Undersea Warfare Ctr Newport Div Newport RI 02841 USA Naval Surface Warfare Ctr Panama City Div Panama City FL 32407 USA

ISBN: (纸本)9781510600782

We describe a problem of optimal planning for unmanned vehicles and illustrate two distinct procedures for its solution. The problem under consideration, which we refer to as the search tour problem, involves the determination of multi-stage plans for unmanned vehicles conducting search operations. These types of problems are important in situations where the searcher has varying performance in different regions throughout the domain due to environmental complexity. The ability to provide robust planning for unmanned systems under difficult environmental conditions is critical for their use in search operations. The problem we consider consists of searches with variable times for each of the stages, as well as an additional degree of freedom for each stage to select from one of a finite set of operational configurations. As each combination of configuration and stage time leads to a different performance level, there is a need to determine the optimal configuration of these stages. When the complexity of constraints on total time, as well as resources expended at each stage for a given configuration, are added, the problem becomes one of non-trivial search effort allocation and numerical methods of optimization are required. We show two solution approaches for this numerical optimization problem. The first solution technique is to use a mixed-integer linear programming formulation, for which commercially available solvers can find optimal solutions in a reasonable amount of time. We use this solution as a baseline and compare against a new inner/outer optimization formulation. This inner/outer optimization compares favorably to the baseline solution, but is also amenable to adaptation as the search operation progresses. Numerical examples illustrate the utility of the approach for unmanned vehicle search planning.

关键词： planning algorithms mixed-integer linear programming inner/outer optimization unmanned vehicles search and rescue vehicle control

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：