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

A Two-Stage cooperative Evolutionary algorithm With Problem-Specific Knowledge for Energy-Efficient Scheduling of No-Wait Flow-Shop Problem

引用

IEEE TRANSACTIONS ON CYBERNETICS 2021年第11期51卷 5291-5303页

作者： Zhao, Fuqing He, Xuan Wang, Ling Lanzhou Univ Technol Sch Comp & Commun Technol Lanzhou 730050 Peoples R China Tsinghua Univ Dept Automat Beijing 100084 Peoples R China

Green scheduling in the manufacturing industry has attracted increasing attention in academic research and industrial applications with a focus on energy saving. As a typical scheduling problem, the no-wait flow-shop scheduling has been extensively studied due to its wide industrial applications. However, energy consumption is usually ignored in the study of typical scheduling problems. In this article, a two-stage cooperative evolutionary algorithm with problem-specific knowledge called TS-CEA is proposed to address energy-efficient scheduling of the no-wait flow-shop problem (EENWFSP) with the criteria of minimizing both makespan and total energy consumption. In TS-CEA, two constructive heuristics are designed to generate a desirable initial solution after analyzing the properties of the problem. In the first stage of TS-CEA, an iterative local search strategy (ILS) is employed to explore potential extreme solutions. Moreover, a hybrid neighborhood structure is designed to improve the quality of the solution. In the second stage of TS-CEA, a mutation strategy based on critical path knowledge is proposed to extend the extreme solutions to the Pareto front. Moreover, a co-evolutionary closed-loop system is generated with ILS and mutation strategies in the iteration process. Numerical results demonstrate the effectiveness and efficiency of TS-CEA in solving the EENWFSP.

关键词： Job shop scheduling Energy consumption Search problems Steel Optimization Manufacturing cooperative algorithm energy efficient knowledge no-wait flow-shop scheduling total energy consumption (TEC)

来源：评论

学校读者我要写书评

暂无评论

Bearing-Based Reliable cooperative Localization for Multiagent Networks in the Presence of Malicious Measurements

引用

IEEE TRANSACTIONS ON AUTOMATIC CONTROL 2024年第6期69卷 3560-3575页

作者： Shi, Chong-Xiao Yang, Guang-Hong Northeastern Univ Coll Informat Sci & Engn Shenyang 110819 Peoples R China Northeastern Univ Key Lab Integrated Automat Proc Ind Minist Educ Shenyang 110819 Peoples R China King Abdulaziz Univ Dept Elect & Comp Engn Jeddah 21589 Saudi Arabia

Due to the development of bearing-based sensors, the bearing-based localization becomes a typical technology for solving localization problems for multiagent networks. Most of the existing bearing-based network localization methods are developed under a secure environment. In contrast, this article studies a reliable bearing-based network localization problem in an adversarial environment, where some bearing measurements of the agents may be corrupted (which are called the malicious measurements). To address this problem, a relationship between the reliability and localizability of a multiagent network is first established, based on which a sufficient and necessary condition is then given to show how to search the malicious bearing measurements in the network. Furthermore, under the given condition, a new class of algorithms is designed, which enables the agents to cooperatively generate the estimations about their own locations, such that the estimation error is bounded. Especially, the error bound can be arbitrarily small, which relies on an adjustable parameter and is independent of the malicious measurements. In addition, the proposed algorithms are also extended to a localization scenario with measurement errors. Finally, the simulations are provided to demonstrate the effectiveness of the proposed algorithms.

关键词： Location awareness Reliability Reliability engineering Computer network reliability Measurement errors Task analysis Search problems Bearing-based network localization cooperative algorithm multiagent networks reliability

来源：评论

学校读者我要写书评

暂无评论

cooperative Double-Layer Genetic Programming Hyper-Heuristic for Online Container Terminal Truck Dispatching

引用

IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION 2023年第5期27卷 1220-1234页

作者： Chen, Xinan Bai, Ruibin Qu, Rong Dong, Haibo Univ Nottingham Ningbo China Sch Comp Sci Ningbo 315100 Peoples R China Univ Nottingham Ningbo China Sch Comp Sci Ningbo 315100 Peoples R China

In a marine container terminal, truck dispatching is a crucial problem that impacts the operation efficiency of the whole port. Traditionally, this problem is formulated as an offline optimization problem, whose solutions are, however, impractical for most real-world scenarios primarily because of the uncertainties of dynamic events in both yard operations and seaside loading-unloading operations. These solutions are either unattractive or infeasible to execute. Herein, for more intelligent handling of these uncertainties and dynamics, a novel cooperative double-layer genetic programming hyper-heuristic (CD-GPHH) is proposed to tackle this challenging online optimization problem. In this new CD-GPHH, a novel scenario genetic programming (GP) approach is added on top of a traditional GP method that chooses among different GP heuristics for different scenarios to facilitate optimized truck dispatching. In contrast to traditional arithmetic GP (AGP) and GP with logic operators (LGP) which only evolve on one population, our CD-GPHH method separates the scenario and the calculation into two populations, which improved the quality of solutions in multi-scenario problems while reducing the search space. Experimental results show that our CD-GPHH dominates AGP and LGP in solving a multiscenario function fitting problem as well as a truck dispatching problem in a container terminal.

关键词： Container port cooperative algorithm genetic programming (GP) hyper-heuristic online truck dispatching

来源：评论

学校读者我要写书评

暂无评论

Spiking cooperative Network Implemented on FPGA for Real-Time Event-Based Stereo System

引用

IEEE ACCESS 2022年 10卷 130806-130815页

作者： Kim, Jung-Gyun Seo, Donghwan Lee, Byung-Geun Gwangju Inst Sci & Technol Dept Elect Engn & Comp Sci Gwangju 61005 South Korea

A hardware-efficient implementation of a spiking cooperative network (SCN) for a real-time event-based stereo correspondence system is presented. While fully utilizing the advantage of event data, the proposed SCN design significantly reduces the amount of hardware resources by utilizing distinct properties of the SCN, such as the repeatability of synaptic connections and operations, through physical constraints. A stereo system consisting of a field-programmable gate array (FPGA) and a pair of dynamic vision sensors (DVSs) is implemented to demonstrate the SCN design. Stereo livestreamed event data are generated from the DVSs, and the SCN is implemented on an FPGA chip to process the event data. The SCN system has four cores, each comprising an array of 32 Coincidence-Disparity units that calculate the 32-level disparity in a semi-parallel manner. The system performance was evaluated experimentally to estimate the depth of objects moving at different speeds. A rotating drum with a diameter of 8 cm was used in the test. The median relative error of the estimated depth at a rotation speed of 16.7 Hz ranged from 7.3% to 10.6%.

关键词： Event detection Real-time system Event-based vision stereo FPGA event-driven computation cooperative algorithm spiking neuron real-time processing

来源：评论

学校读者我要写书评

暂无评论

Integrated scheduling of production, inventory and imperfect maintenance based on mutual feedback of supplier and demander in distributed environment

引用

JOURNAL OF INTELLIGENT MANUFACTURING 2023年第8期34卷 3445-3467页

作者： Wang, Zhen Deng, Qianwang Zhang, Like Liu, Xiaoyan Hunan Univ State Key Lab Adv Design & Mfg Vehicle Body Changsha 410082 Peoples R China Hunan Univ Coll Elect & Informat Engn Changsha 410082 Peoples R China

The previous research on distributed production scheduling focuses on supply side, ignoring the interconnection of supply side and demand side: the delivery time of spare parts from the supply side will influence the maintenance scheduling of distributed equipment of demand side, while the maintenance scheduling of distributed equipment will affect the scheduling decision of supply of spare parts. In addition, in practice, inventory is an important link between manufacturers and customers. Therefore, we firstly propose an optimal scheduling problem of integrated production, inventory and imperfect maintenance with mutual feedback of supply side and demand side, shortened to PIM-DCSP. In PIM-DCSP, production resources and inventory work together to provide spare parts for demand side, while demand side makes imperfect maintenance scheduling for its distributed equipment to postpone deterioration and finally extend the operating time of equipment. The goal of PIM-DCSP is to make an optimal scheduling that jointly optimizes the scheduling of both sides, that is, reasonably arrange production resources, inventory and workers to realize the minimization of the total cost of supplier and the total cost of demander respectively. A mathematical model is established to describe the presented problem and an improved adaptive cooperative algorithm (IACA) is designed. Effective operators including two heuristic initialization methods, six problem-oriented and two random local search structures are developed to strengthen population diversity and search capability. The comparison experiment of IACA and three other outstanding algorithms is carried out on 96 instances, and the superiority of IACA in solving PIM-DCSP is certificated thoroughly.

关键词： Distributed permutation flowshop scheduling Production and maintenance Inventory Mutual feedback cooperative algorithm

来源：评论

学校读者我要写书评

暂无评论

Experimental results of the cooperative operation of autonomous surface vehicles navigating in complex marine environment

引用

OCEAN ENGINEERING 2021年 219卷 108256-108256页

作者： Hinostroza, M. A. Xu, Haitong Soares, C. Guedes Univ Lisbon Ctr Marine Technol & Ocean Engn CENTEC Inst Super Tecn Lisbon Portugal

Experimental results are presented of the cooperative operation of two maritime autonomous surface vehicles (ASVs) executing a pre-defined task in a complex marine environment. The ASVs are equipped with algorithms for motion-planning, path-following and motion control, where the motion-planning algorithm is based in the angle-guidance fast marching square method, the path-planning module is based in the vector-field path-following method and the controller is a PID. The ASVs are two self-propelled models of 2.5 m and 3.2 m length instrumented with several sensors, actuators and communication unit, such as, inertial measurement units, Global positioning system, anemometers, accelerometers, inclinometers, DC motors and Wi-Fi communication. To monitor and command the ASVs, a real-time program was coded in LabVIEW 2018 (R). Finally, in order to validate the developed system, experimental tests were carried out in an open-door pool with low wind conditions, and from these experiments good capabilities of the system were found.

关键词： cooperative algorithm Experimental validation Autonomous surface vehicles Motion planning Model tests

来源：评论

学校读者我要写书评

暂无评论

cooperative operation of autonomous surface vehicles for maintaining formation in complex marine environment

引用

OCEAN ENGINEERING 2019年 183卷 132-154页

作者： Hinostroza, M. A. Xu, Haitong Soares, C. Guedes Univ Lisbon Inst Super Tecn Ctr Marine Technol & Ocean Engn CENTEC Lisbon Portugal

A system for motion-planning, collision avoidance, guidance and control of an autonomous surface vehicles formation, navigating in complex marine environment is presented. The motion-planning unit, which is based in angle-guidance fast-marching square method, is specially developed for operation in dynamic and static environments. The collision avoidance unit is based in fuzzy-logic formulation, the guidance unit uses the vector-field guidance formulation and the control unit is composed by a PID heading controller and a speed controller. The leader-follower's configuration is used for cooperative operation. A set of numerical simulations are carried out for a team of three autonomous surface vehicles navigating in a complex maritime environment including static and dynamic obstacles and the results show good performance of the system.

关键词： Autonomous surface vehicles cooperative algorithm Fast marching method Collision avoidance Vector-field guidance

来源：评论

学校读者我要写书评

暂无评论

Sensor Information Sharing Using a Producer-Consumer algorithm on Small Vehicles

引用

SENSORS 2021年第9期21卷 3022页

作者： Vazquez-Lopez, Rodrigo Herrera-Lozada, Juan Carlos Sandoval-Gutierrez, Jacobo von Bulow, Philipp Martinez-Vazquez, Daniel Librado Inst Politecn Nacl Ctr Innovac & Desarrollo Tecnol Comp CIDETEC Mexico City 07700 DF Mexico Univ Autonoma Metropolitana Unidad Lerma Dept Proc Prod Lerma De Villada 52005 Estado De Mexic Mexico

There are several tools, frameworks, and algorithms to solve information sharing from multiple tasks and robots. Some applications such as ROS, Kafka, and MAVLink cover most problems when using operating systems. However, they cannot be used for particular problems that demand optimization of resources. Therefore, the objective was to design a solution to fit the resources of small vehicles. The methodology consisted of defining the group of vehicles with low performance or are not compatible with high-level known applications;design a reduced, modular, and compatible architecture;design a producer-consumer algorithm that adjusts to the simultaneous localization and communication of multiple vehicles with UWB sensors;validate the operation with an interception task. The results showed the feasibility of performing architecture for embedded systems compatible with other applications managing information through the proposed algorithm allowed to complete the interception task between two vehicles. Another result was to determine the system's efficiency by scaling the memory size and comparing its performance. The work's contributions show the areas of opportunity to develop architectures focusing on the optimization of robot resources and complement existing ones.

关键词： absolute position system cooperative algorithm intercepting vehicles indoor positioning robot framework UWB sensors

来源：评论

学校读者我要写书评

暂无评论

Recent Progress on Multiple-Unmanned Aerial Vehicle Collision Avoidance algorithms

Recent Progress on Multiple-Unmanned Aerial Vehicle Collisio...

引用

Chinese Automation Congress (CAC)

作者： Xu, Jia Hu, Chunhe Beijing Forestry Univ Sch Technol Beijing Peoples R China

ISBN: (纸本)9781728176871

In recent years, the development of small unmanned aerial vehicle (UAV) has greatly promoted the development of UAV swarms. As multi-UAV arc widely applied in more scenarios, the collision avoidance problems have attracted more attention. This paper discussed the basic problems of collision avoiding about multi-UAV, and sorted out the collision avoidance algorithms of multiple UAVs. We divide the UAV collision avoidance algorithm into two parts, one is cooperative algorithm and another is non-cooperative algorithm. Then, according to the current algorithm development, the development trend of multi-UAV collision avoidance research in the further are discussed.

关键词： Unmanned Aerial Vehicle Collision avoidance cooperative algorithm Non-cooperative algorithms

来源：评论

学校读者我要写书评

暂无评论

Network Repair algorithms for Wireless Sensors and Actuators Based on Graph Theory

Network Repair Algorithms for Wireless Sensors and Actuators...

引用

International Conference on Advances in Materials and Manufacturing Engineering (ICAMME)

作者： Ju Jinquan Al-Absi, Mohammed Abdulhakim Lee, Hoon Jae Dongseo Univ Div Informat & Commun Engn 47 Jurye Ro Busan 47011 South Korea

ISBN: (纸本)9789811513077;9789811513060

In view of the shortcomings of traditional wireless sensor and actuator networks, such as low speed and high consumption, this paper studies the repair algorithm of wireless sensor and actuator networks based on graph theory. Firstly, the concept of wireless sensor and actuator network is analyzed, then the cooperative algorithm of wireless sensor and actuator network is elaborated, and a SA cooperative algorithm with low energy consumption and low latency is proposed. Finally, the algorithm of cut-point detection is summarized. The algorithm is mainly based on simulation model NS2 and topological repair of cut point. The simulation results show that the real-time performance and energy consumption of the proposed algorithm are better than those of K-IDS algorithm and RCR algorithm.

关键词： Cut-point detection WSAN Wireless sensor Actuator network Repair algorithm cooperative algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：