2010 IEEE/RSJ International Conference on Intelligent Robots and Systems 2010
DOI: 10.1109/iros.2010.5651948
|View full text |Cite
|
Sign up to set email alerts
|

Genetic Algorithms based method for time optimization in robotized site

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
19
0

Year Published

2013
2013
2024
2024

Publication Types

Select...
6
1
1

Relationship

0
8

Authors

Journals

citations
Cited by 18 publications
(19 citation statements)
references
References 12 publications
0
19
0
Order By: Relevance
“…Zacharia et al [4] involved the robot kinematics and applied a Genetic Algorithm to optimize the task sequence. Baizid et al [5] extended their approach by optimizing location of the robot's base. Saha et al [10] proposed the approach that involves collision-free path planning into the problem of task sequence calculation.…”
Section: A Robotic Backgroundmentioning
confidence: 99%
See 1 more Smart Citation
“…Zacharia et al [4] involved the robot kinematics and applied a Genetic Algorithm to optimize the task sequence. Baizid et al [5] extended their approach by optimizing location of the robot's base. Saha et al [10] proposed the approach that involves collision-free path planning into the problem of task sequence calculation.…”
Section: A Robotic Backgroundmentioning
confidence: 99%
“…One way to minimize the cost is to optimize the task sequence. There are many approaches that aim at minimizing the sequence of strictly defined tasks and also considering robot kinematics, e.g., [4] [5]. Some approaches exploit the freedom of effective tasks execution for optimization, however, they ignore the robot kinematics and use Euclidean metric instead, e.g., [6] [7].…”
Section: Introductionmentioning
confidence: 99%
“…The first part represents the waypoint sequence, while the second part represents the sequence of the joint configurations at the waypoints, which corresponds to the first part. In [23], each chromosome consists of three parts, the waypoint sequence, the sequence of joint configurations, and the robot placement. The technique of dividing each chromosome into several parts was also employed in [24][25][26].…”
Section: Introductionmentioning
confidence: 99%
“…The technique of dividing each chromosome into several parts was also employed in [24][25][26]. A common point of IGAs in [22][23][24][25][26] is that the parameter denoting the joint angular velocity is predefined as a constant. The other category of approaches aims at dividing MTTP into several subproblems which are then solved successively.…”
Section: Introductionmentioning
confidence: 99%
“…Recent papers like [14]- [16] also present GAs for the optimization of tasks and configurations of modular homogeneous reconfigurable robots and manipulators.…”
Section: Introductionmentioning
confidence: 99%