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

IEEE International Conference on Networking, Sensing and control

作者： Haoyi Niu Zichao Xing Xingkai Wang Weimin Wu Tao Zhang State Key Laboratory of Industrial Control Technology Institute of Cyber-Systems and Control Zhejiang University Hangzhou China

ISBN: (纸本)9781665440493

This paper studies a flexible flow-shop scheduling problem with limited resources (FFSP-LR) which is based on an actual air-conditioning production line in an intelligent manufacturing system. It extends the classical flexible flow-shop scheduling problem by considering practical constraints of the number of the AGVs (automated guided vehicles) on the transportation resources. The problem aims to determine the optimal scheduling results that minimizes the idle waiting time and pick-up waiting time of the workstations. To solve this problem, a pre-waiting scheduling model (PWSM) is proposed by taking into account the advance waiting time of AGVs. The experimental results show that the proposed PWSM is able to reduce idle waiting time and pick-up waiting time up to 425.01 and 414.25 comparing to traditional FCFS (First Come First Serve) strategy respectively. Correspondingly, these two types of time could be saved up to 87.01% and 98.57%. Finally, the overall efficiency of the intelligent manufacturing system is improved since the PWSM is able to effectively reduce the idle waiting time and pick-up waiting time of the workstations under the condition of limited transportation resources.

关键词： Job shop scheduling Transportation Optimal scheduling Production Workstations Numerical models Sensors

来源：评论

学校读者我要写书评

暂无评论

Efficient Object Manipulation to an Arbitrary Goal Pose: Learning-based Anytime Prioritized Planning

arXiv

引用

arXiv 2021年

作者： Xu, Kechun Yu, Hongxiang Huang, Renlang Guo, Dashun Wang, Yue Xiong, Rong The State Key Laboratory of Industrial Control Technology Institute of Cyber-Systems and Control Zhejiang University Hangzhou China

We focus on the task of object manipulation to an arbitrary goal pose, in which a robot is supposed to pick an assigned object to place at the goal position with a specific orientation. However, limited by the execution space of the manipulator with gripper, one-step picking, moving and releasing might be failed, where a reorientation object pose is required as a transition. In this paper, we propose a learningdriven anytime prioritized search-based solver to find a feasible solution with low path cost in a short time. In our work, the problem is formulated as a hierarchical learning problem, with the high level finding a reorientation object pose, and the low level planning paths between adjacent grasps. We learn an offline-training path cost estimator to predict approximate path planning costs, which serve as pseudo rewards to allow for pre-training the high-level planner without interacting with the simulator. To deal with the problem of distribution mismatch of the cost net and the actual execution cost space, a refined training stage is conducted with simulation interaction. A series of experiments carried out in simulation and real world indicate that our system can achieve better performances in the object manipulation task with less time and less cost. Copyright © 2021, The Authors. All rights reserved.

关键词： Cost estimating

来源：评论

学校读者我要写书评

暂无评论

A Novel Searching Method of Fringe Blocks for AGV Deadlock Avoidance

A Novel Searching Method of Fringe Blocks for AGV Deadlock A...

引用

IEEE International Conference on Networking, Sensing and control

作者： Xinyu Chen Tingqi Zhang Weimin Wu Ruifen Hu State Key Laboratory of Industrial Control Technology Institute of Cyber-Systems and Control Zhejiang University Hangzhou China

ISBN: (纸本)9781665440493

With the increasing development of automated logistics systems, automated guided vehicles (AGVs) have been gradually deployed in various logistics systems. AGVs are mainly used to transport materials and products, which promote the efficiency greatly and provide profound flexibility and safety. The strategy to prevent AGVs from forming deadlocks is one of the fundamental and vital issues in applications. In this paper, a common type of deadlock that usually occurs in warehouses and a typical attribute of map called fringe blocks are studied thoroughly. To solve the deadlock, it’s crucial to identify fringe blocks. We first use traditional depth first search algorithm (DFS) to find out all the fringe blocks in the map. Then, confronted with the huge time complexity, we combine the DFS procedure with a high-efficiency trimming method. Finally, we run a simulation and make a comparison of both methods. The simulation results have shown that the proposed strategy will reduce computational time significantly without making false judgements.

关键词： Remotely guided vehicles Simulation Computational modeling Conferences System recovery Search problems Sensors

来源：评论

学校读者我要写书评

暂无评论

Learn to differ: Sim2Real small defection segmentation network

arXiv

引用

arXiv 2021年

作者： Chen, Zexi Huang, Zheyuan Wang, Yunkai Xu, Xuecheng Wang, Yue Xiong, Rong The State Key Laboratory of Industrial Control Technology Institute of Cyber-Systems and Control Zhejiang University Zhejiang China

Recent studies on deep-learning-based small defection segmentation approaches are trained in specific settings and tend to be limited by fixed context. Throughout the training, the network inevitably learns the representation of the background of the training data before figuring out the defection. They underperform in the inference stage once the context changed and can only be solved by training in every new settings. This eventually leads to the limitation in practical robotic applications where contexts keep varying. To cope with this, instead of training a network context by context and hoping it to generalize, why not stop misleading it with any limited context and start training it with pure simulation? In this paper, we propose the network SSDS that learns a way of distinguishing small defections between two images regardless of the context, so that the network can be trained once for all. A small defection detection layer utilizing the pose sensitivity of phase correlation between images is introduced and is followed by an outlier masking layer. The network is trained on randomly generated simulated data with simple shapes and is generalized across the real world. Finally, SSDS is validated on real-world collected data and demonstrates the ability that even when trained in cheap simulation, SSDS can still find small defections in the real world showing the effectiveness and its potential for practical applications. © 2021, CC BY.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

HiTMap: A Hierarchical Topological Map Representation for Navigation in Unknown Environments

arXiv

引用

arXiv 2021年

作者： Xu, Xuecheng Wang, Cheng Wang, Yue Xiong, Rong State Key Laboratory of Industrial Control Technology Institute of Cyber-Systems and Control Zhejiang University Zhejiang China

— The ability to autonomously navigate in unknown environments is important for mobile robots. The map is the core component to achieve this. Most map representations rely on drift-free state estimation and provide a global metric map to navigate. However, in large-scale real-world applications, it’s hard to prohibit drifts and compose a globally consistent map quickly. In this paper, a novel representation named, HiTMap, is proposed to enhance the existing map representations. The central idea is to adopt a submap-based hierarchical topology rather than a global metric map so that only a local metric map is maintained for obstacle avoidance which ensures the lightweight of the representation. To guide the robots navigate into unknown spaces, frontiers are detected and attached to the map as an attribute. We also develop a path planning module to evaluate the feasibility and efficiency of our map representation. The system is validated in a simulation environment and a demonstration in the real world is conducted. In addition, the HiTMap is made available open-source. https://***/MaverickPeter/HiTMap. © 2021, CC BY.

关键词： Navigation

来源：评论

学校读者我要写书评

暂无评论

Research on Container Slot Planning for Coordinated Operation of Quay Cranes and Yard Cranes

Research on Container Slot Planning for Coordinated Operatio...

引用

IEEE International Conference on Networking, Sensing and control

作者： Lili Huang Weimin Wu State Key Laboratory of Industrial Control Technology Institute of Cyber-Systems and Control Zhejiang University Hangzhou China

ISBN: (纸本)9781665440493

Given ship per-stowage plan and yard stacking status, this paper presents a method on container slot planning for coordinated operation of quay cranes (QC) and yard cranes (YC). A multi-objective programming model is established with the goal of maximizing the turnover rate of container terminal. Then, a heuristic construction algorithm is designed to obtain an initial stowage plan. In addition, an annealing genetic algorithm is proposed to optimize this initial solution. A wide variety of numerical experiments demonstrated that stowage plans made by this method are useful and applicable in practice.

关键词： Cranes Heuristic algorithms Stacking Containers Pareto optimization Planning Sensors

来源：评论

学校读者我要写书评

暂无评论

Battery Charge Dispatching in Multi-robot systems

Battery Charge Dispatching in Multi-robot Systems

引用

IEEE International Conference on Networking, Sensing and control

作者： Zichao Xing Weimin Wu Haoyi Niu Ruifen Hu State Key Laboratory of Industrial Control Technology Institute of Cyber-Systems and Control Zhejiang University Hangzhou China

ISBN: (纸本)9781665440493

Multi-robot systems (MRSs) attract more and more attention due to their efficiency and safety. In a practical scenario, robots need to work for a long time without human intervention, which requires the robots do not run out of power. The battery charging strategy of most systems uses a fixed threshold or fixed periods to determine when robots should be charged. It does not consider the system task situation, nor the situation of charging station (CS) competition. This paper proposes an efficient charge dispatching strategy, which can ensure that a robot firstly completes a task quickly when it is scheduled to work and firstly be charged to be ready for a subsequent task when it is idle. For the case that multiple robots compete for the same CS, we designe a bidding strategy to determine which robot should be serviced. A rule-based charging strategy is used to compare with the proposed charge dispatching strategy in this paper. The results show that our method performs better in terms of stability and efficiency.

关键词： Conferences Robot sensing systems control systems Dispatching Batteries Sensors Safety

来源：评论

学校读者我要写书评

暂无评论

A Two-Stage Congestion-Aware Routing Method for Automated Guided Vehicles in Warehouses

A Two-Stage Congestion-Aware Routing Method for Automated Gu...

引用

IEEE International Conference on Networking, Sensing and control

作者： Xinyu Chen Ligen Feng Xingkai Wang Weimin Wu Ruifen Hu State Key Laboratory of Industrial Control Technology Institute of Cyber-Systems and Control Zhejiang University Hangzhou China

ISBN: (纸本)9781665440493

With multi-AGV (automated guided vehicle) systems gradually employed in modern warehouses, the research on how to coordinate AGVs in an efficient way has attracted more scholars than ever. As the size of AGVs grows over time, the possibility of traffic congestion is increasing rapidly, especially in a limited space. Therefore, the congestion-aware routing method is one of the most vital and fundamental topics in multi-AGV control research. In this paper, a two-stage congestion-minimizing routing method is presented. The proposed method not only plans paths that avoid congested areas, but also changes paths in real time to cope with the volatile traffic situations. An experiment is carried out to test the effectiveness and efficiency of the proposed method, and the results are highly promising in terms of alleviating traffic congestion.

关键词： Solid modeling Remotely guided vehicles Heuristic algorithms Production Routing Real-time systems Sensors

来源：评论

学校读者我要写书评

暂无评论

Research on Coupled Task Allocation and Scheduling of Multi-type Robots

Research on Coupled Task Allocation and Scheduling of Multi-...

引用

IEEE International Conference on Networking, Sensing and control

作者： Xingkai Wang Zichao Xing Weimin Wu Xinyu Chen State Key Laboratory of Industrial Control Technology Institute of Cyber-Systems and Control Zhejiang University Hangzhou China

ISBN: (纸本)9781665440493

Task allocation problem and scheduling problem have always been hot topics in the robotics research field. Both of them can be divided into many categories. Among all these categories, coupled task allocation and scheduling problem (CTASP) is a quite difficult problem, especially for of multi-type robots. However, few researches are conducted on this area. Usually, the CTASP is studied for multi-type robots with fixed execution sequence in the reported literature. However, this paper will study the CTASP for multi-type robots with flexible execution sequence. A two-dimension genetic algorithm (TDGA) is designed to solve this type of problem, combined with rank minimal heuristic (RMH) algorithm to provide an elite strategy. The simulation experiment proves that TDGA can solve this kind of problems efficiently, and the efficiency of hybrid genetic algorithm has been further improved.

关键词： Heuristic algorithms Conferences Robot sensing systems Scheduling Sensors Resource management Task analysis

来源：评论

学校读者我要写书评

暂无评论

A Hybrid Algorithm to Solve Periodic Vehicle Dispatching Problem with Heterogeneous Vehicles in Logistics Transportation

A Hybrid Algorithm to Solve Periodic Vehicle Dispatching Pro...

引用

IEEE International Conference on Networking, Sensing and control

作者： Xingkai Wang Zichao Xing Weimin Wu Xinyu Chen State Key Laboratory of Industrial Control Technology Institute of Cyber-Systems and Control Zhejiang University Hangzhou China

ISBN: (纸本)9781665440493

The vehicle dispatching problem (VDP) is researching how to arrange vehicles’ transportation, which has been addressed by many scholars. In the field of logistics transportation, the vehicle dispatching problem is presented in a special form, that is, the periodic vehicle dispatching problem (PVDP) with heterogeneous vehicles. In order to solve this problem and improve the efficiency of vehicles, a round recombination algorithm (RRA) with two operators are designed in this paper. And a hybrid algorithm consisting of RRA and simulated annealing algorithm is also proposed to improve RRA. Three groups of experiments are carried out to test the performance of designed algorithms in different scenarios. The results of these experiments prove the effectiveness of RRA. The results also show the superiority of hybrid algorithm to RRA.

关键词： Annealing Conferences Transportation Simulated annealing Production Dispatching Mathematical models

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：