Search Sites

Transactions of the Institute of Systems, Control and Information Engineers Vol. 25 (2012), No. 5

ISIJ International
belloff
ONLINE ISSN: 2185-811X
PRINT ISSN: 1342-5668
Publisher: THE INSTITUTE OF SYSTEMS, CONTROL AND INFORMATION ENGINEERS (ISCIE)

Backnumber

  1. Vol. 37 (2024)

  2. Vol. 36 (2023)

  3. Vol. 35 (2022)

  4. Vol. 34 (2021)

  5. Vol. 33 (2020)

  6. Vol. 32 (2019)

  7. Vol. 31 (2018)

  8. Vol. 30 (2017)

  9. Vol. 29 (2016)

  10. Vol. 28 (2015)

  11. Vol. 27 (2014)

  12. Vol. 26 (2013)

  13. Vol. 25 (2012)

  14. Vol. 24 (2011)

  15. Vol. 23 (2010)

  16. Vol. 22 (2009)

  17. Vol. 21 (2008)

  18. Vol. 20 (2007)

  19. Vol. 19 (2006)

  20. Vol. 18 (2005)

  21. Vol. 17 (2004)

  22. Vol. 16 (2003)

  23. Vol. 15 (2002)

  24. Vol. 14 (2001)

  25. Vol. 13 (2000)

  26. Vol. 12 (1999)

  27. Vol. 11 (1998)

  28. Vol. 10 (1997)

  29. Vol. 9 (1996)

  30. Vol. 8 (1995)

  31. Vol. 7 (1994)

  32. Vol. 6 (1993)

  33. Vol. 5 (1992)

  34. Vol. 4 (1991)

  35. Vol. 3 (1990)

  36. Vol. 2 (1989)

  37. Vol. 1 (1988)

Transactions of the Institute of Systems, Control and Information Engineers Vol. 25 (2012), No. 5

Multi-Swarm Particle Swarm Optimization with an Adaptive Type Selection for Restarting Particles

Keiji Tatsumi, Takashi Yukami, Tetsuzo Tanino

pp. 105-116

Abstract

The particle swarm optimization method (PSO) is one of popular metaheuristic methods for global optimization. Although the PSO is simple and shows a good performance of finding a desirable solution, it is reported that almost all particles sometimes converge to an undesirable local minimum for some problems. Thus, many kinds of improved methods have been proposed to keep the diversity of the search process. In this paper, we propose a novel multi-type swarm PSO which uses two kinds of particles and multiple swarms including either kind of particles. All particles in each swarm search for solutions independently where the exchange of information between different swarms is restricted for the extensive exploration. In addition, the proposed model has the restarting system of particles which initializes a particle with a sufficiently small velocity by resetting its velocity and position, and adaptively selects the kind of the particle according to which kind of particles contribute to improvement of the objective function value. Furthermore, through some numerical experiments, we verify the abilities of the proposed model.

Bookmark

Share it with SNS

Article Title

Multi-Swarm Particle Swarm Optimization with an Adaptive Type Selection for Restarting Particles

Hi-Speed Tactile Sensing for Array-type Tactile Sensor and Object Manipulation based on Tactile Information

Wataru Fukui, Futoshi Kobayashi, Fumio Kojima, Hiroyuki Nakamoto, Tadashi Maeda, Nobuaki Imamura, Hidenori Shirasawa

pp. 117-125

Abstract

Recently, a robotic hand with tactile sensors is developed all over the world. We also have developed a universal robot hand with tactile sensors and other sensors. Tactile sensors are very important for manipulating objects dexterously. However, array-type tactile sensor has many I/O, thus require much processing time. In this paper, we propose a hi-speed tactile sensing based on the genetic algorithm in order to measure the tactile information rapidly. The validity of the proposed method shows through some experiments. Moreover, a multi-object manipulation according to the tactile information is proposed.

Bookmark

Share it with SNS

Article Title

Hi-Speed Tactile Sensing for Array-type Tactile Sensor and Object Manipulation based on Tactile Information

A Real-Time Algorithm for Constrained Nonlinear Receding Horizon Control Based on Off-Line Singular Value Decomposition

Keita Akayama, Toshiyuki Ohtsuka

pp. 126-133

Abstract

In this paper, a real-time algorithm for nonlinear receding horizon control using the continuation/GMRES method (C/GMRES) is proposed. The continuation method is combined with a Krylov subspace method, GMRES, to update control input by solving a linear equation. In addition, we utilize singular value decomposition, which reduces the size of the linear equation, for the off-line optimization result to speed up on-line calculations, and a barrier function to deal with constraints on the control input. Simulation results show that the proposed algorithm is faster than the conventional C/GMRES.

Bookmark

Share it with SNS

Article Title

A Real-Time Algorithm for Constrained Nonlinear Receding Horizon Control Based on Off-Line Singular Value Decomposition

You can use this feature after you logged into the site.
Please click the button below.

Advanced Search

Article Title

Author

Abstract

Journal Title

Year

Please enter the publication date
with Christian era
(4 digits).

Please enter your search criteria.