中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
机构
采集方式
内容类型
发表日期
学科主题
筛选

浏览/检索结果: 共8条,第1-8条 帮助

条数/页: 排序方式:
One-Stage Cascade Refinement Networks for Infrared Small Target Detection 期刊论文  OAI收割
IEEE TRANSACTIONS ON GEOSCIENCE AND REMOTE SENSING, 2023, 卷号: 61
作者:  
Dai, Yimian;  Li, Xiang;  Zhou, Fei;  Qian, Yulei;  Chen, Yaohong
  |  收藏  |  浏览/下载:36/0  |  提交时间:2023/03/29
A path planning and following algorithm of observing targets for the UVMS Robocutt-I 会议论文  OAI收割
13th World Congress on Intelligent Control and Automation, 沈阳, 2014
作者:  
Yu Wang;  Shuo Wang;  Min Tan;  Wang S(王硕)
收藏  |  浏览/下载:20/0  |  提交时间:2015/08/19
HONEYBEE MATING OPTIMIZATION ALGORITHM FOR TASK ASSIGNMENT IN HETEROGENEOUS COMPUTING SYSTEMS 期刊论文  OAI收割
INTELLIGENT AUTOMATION AND SOFT COMPUTING, 2013, 卷号: 19, 期号: 1, 页码: 69-84
Kang, Qinma; He, Hong
  |  收藏  |  浏览/下载:21/0  |  提交时间:2014/12/16
Task assignment for minimizing application completion time using honeybee mating optimization 期刊论文  OAI收割
FRONTIERS OF COMPUTER SCIENCE, 2013, 卷号: 7, 期号: 3, 页码: 404-415
Kang, Qinma; He, Hong
  |  收藏  |  浏览/下载:16/0  |  提交时间:2014/12/16
An efficient discrete particle swarm algorithm for task assignment problems (EI CONFERENCE) 会议论文  OAI收割
2009 IEEE International Conference on Granular Computing, GRC 2009, August 17, 2009 - August 19, 2009, Nanchang, China
作者:  
Wang C.
收藏  |  浏览/下载:15/0  |  提交时间:2013/03/25
Task Assignment Problems (TAPs) in distributed computer system are general NP-hard and usually modeled as integer programming discrete problems. Many algorithms are proposed to resolve those problems. Discrete particle swarm algorithm (DPS) is a newly developed method to solve constraint satisfaction problem (CSP) which has advantage on search capacity and can find more solutions. We proposed an improved DPS to solve TAP in this paper. DPS has a special operator namely coefficient multiplying speed  which is designed for CSP but does not exist in other discrete problems. Thus we redefined a coefficient multiplying speed operator with probability selection. We analyzed the speed and position updating formula then we derived a refined position updating formula. Several experiments are carried out to test our DPS. Experimental results show that our algorithm has more efficient search capacity  higher success rate  less running time and more robust.  
Adaptive task assignment for multiple mobile robots via swarm intelligence approach 期刊论文  OAI收割
Robotics and Autonomous Systems, 2007, 卷号: 55, 期号: 7, 页码: 572–588
作者:  
Zhang, Dandan;  Xie, Guangming;  Yu, Junzhi;  Wang, Long;  Wang Long
  |  收藏  |  浏览/下载:23/0  |  提交时间:2017/01/24
An adaptive task assignment method for multiple mobile robots via swarm intelligence approach 会议论文  OAI收割
Espoo, Finland, June 27, 2005 - June 30, 2005
作者:  
Zhang, Danda;  Xie, Guangmin;  Yu, Junzhi;  Wang, Lon;  Zhang, Dandan
  |  收藏  |  浏览/下载:20/0  |  提交时间:2017/01/24
基于多机器人协调的搜集与围捕问题的研究 学位论文  OAI收割
工学硕士, 中国科学院自动化研究所: 中国科学院研究生院, 2003
王姝莉
收藏  |  浏览/下载:45/0  |  提交时间:2015/09/02