Results 101 to 110 of about 20,504 (267)
Key Technical Fields and Future Outlooks of Space Manipulators: A Survey
SmartBot, EarlyView.This paper systematically reviews the technological development of space manipulators, emphasizing the unique challenges posed by space environments. It examines four areas: structural design, modeling, planning, and control, while introducing typical ground test platforms.
Gang Chen +12 more
wiley +1 more source
CAAI Transactions on Intelligence Technology, EarlyView.Abstract In a multi‐row facility layout problem (MRFLP), facilities are arranged in more than one row under the limited layout area. Considering different layout factors, various extensions of MRFLP have been modelled. However, the orientation of input/output (I/O) point in a facility, as a key factor that plays a direct impact on flow cost, is seldom ...
Yinan Guo +5 more
wiley +1 more source
An ant system algorithm for automated trajectory planning
, 2010 The paper presents an Ant System based algorithm to optimally plan multi-gravity assist trajectories. The algorithm is designed to solve planning problems in which there is a strong dependency of one decision one all the previously made decisions. In the
Vasile, M., Ceriotti, M.
core +1 more source
MGA trajectory planning with an ACO-inspired algorithm [PDF]
, 2009 Given a set of celestial bodies, the problem of finding an optimal sequence of gravity assist manoeuvres, deep space manoeuvres (DSM) and transfer arcs connecting two or more bodies in the set is combinatorial in nature.
Vasile, M., Ceriotti, M.
core +1 more source
Building Blocks as Experiences in Dynamic Capacitated Arc Routing Problems
CAAI Transactions on Intelligence Technology, EarlyView.ABSTRACT The dynamic capacitated arc routing problem (DCARP) aims to update the service paths of vehicles in the capacitated arc routing problem when uncertain factors deteriorate the current schedule of vehicles' services. A DCARP scenario comprises a series of DCARP instances that share similarities with each other. Therefore, optimisation experience
Hao Tong +4 more
wiley +1 more source
, 2010 Ant Colony Optimization (ACO) differs substantially from other meta-heuristics such as Evolutionary Algorithms (EA). Two of its distinctive features are: (i) it is constructive rather than based on iterative improvements, and (ii) it employs problem ...
Otero, Fernando E.B. +5 more
core +1 more source
A TSP Solving Model Based on Immune Ant Colony Hybrid Algorithm
工程科学与技术, 2010 :In order to solve the problems caused by the traditional ant colony algorithm, such as searching slowly, cling to prematurity, standstill, and the inefficient and useless redundant iteration caused by feedback underutilized in traditional immune ...
Liu Yong, Liu Nian, Liu Sunjun
doaj
Ant Colony Optimization Algorithm
Journal of Applied Technology and InnovationACO is a potent algorithm inspired by ants' social behavior. It can solve complex computational problems and offers a promising approach to finding near-optimal solutions in various domains. This essay focuses on ACO's potential to solve the Travelling Salesman Problem (TSP) by mimicking ants' pheromone-based path finding.
Olive Cheong Yu Xuan +5 more
openaire +1 more source
Performance analysis for network coding using ant colony routing
, 2011 This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.The aim of this thesis is to conduct performance investigation of a combined system of Network Coding (NC) technique with Ant-Colony (ACO) routing protocol.
Sabri, Dalia
core
Ant-Colony Based Near-ML Space-Time Multiuser Detection for the STBC Assisted DS-CDMA Uplink
, 2010 In this contribution, a novel Ant Colony Optimization (ACO) based Space-Time (ST) Multiuser Detection (MUD) algorithm was proposed in order to improve the Bit Error Ratio (BER) versus Signal-to-Noise Ratio (SNR) performance achieved by the Space-Time ...
Yang, Lie-Liang +5 more
core +1 more source