Search Sites

Transactions of the Institute of Systems, Control and Information Engineers Vol. 3 (1990), No. 1

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

Backnumber

  1. Vol. 36 (2023)

  2. Vol. 35 (2022)

  3. Vol. 34 (2021)

  4. Vol. 33 (2020)

  5. Vol. 32 (2019)

  6. Vol. 31 (2018)

  7. Vol. 30 (2017)

  8. Vol. 29 (2016)

  9. Vol. 28 (2015)

  10. Vol. 27 (2014)

  11. Vol. 26 (2013)

  12. Vol. 25 (2012)

  13. Vol. 24 (2011)

  14. Vol. 23 (2010)

  15. Vol. 22 (2009)

  16. Vol. 21 (2008)

  17. Vol. 20 (2007)

  18. Vol. 19 (2006)

  19. Vol. 18 (2005)

  20. Vol. 17 (2004)

  21. Vol. 16 (2003)

  22. Vol. 15 (2002)

  23. Vol. 14 (2001)

  24. Vol. 13 (2000)

  25. Vol. 12 (1999)

  26. Vol. 11 (1998)

  27. Vol. 10 (1997)

  28. Vol. 9 (1996)

  29. Vol. 8 (1995)

  30. Vol. 7 (1994)

  31. Vol. 6 (1993)

  32. Vol. 5 (1992)

  33. Vol. 4 (1991)

  34. Vol. 3 (1990)

  35. Vol. 2 (1989)

  36. Vol. 1 (1988)

Transactions of the Institute of Systems, Control and Information Engineers Vol. 3 (1990), No. 1

Collision Avoidance between Mobile Robots

Mamoru SAITO, Toshihiro TSUMURA

pp. 1-7

Abstract

This paper presents a new algorithm for realtime collision avoidance of two mobile robots based on a heuristic risk evaluation. The main idea of this algorithm is to express the collision avoidance problem of mobile robots in terms of the velocity vector modification. A distance function obtained from the state information of two neighboring robots is introduced to evaluate the risk of collision. According to the encounter situation of robots resulting from the risk evaluation, the desired velocity vectors are determined for each robot. The robots can avoid collision from each other by following their desired velocity vectors.
In a simulation study, the proposed algorithm is applied to various colliding situations of two robots and achieves acceptable performance. The feasibility and the effectiveness of our method are also discussed through the simulation results.

Bookmark

Share it with SNS

Article Title

Collision Avoidance between Mobile Robots

Control Strategy Design of Large Space Structures

Shintaro ISHIJIMA, Hidekiyo ITAKURA, Hironori FUJII

pp. 8-13

Abstract

A new control strategy called a generalized energy dissipative control is proposed for the control of linear large space structures with proportional damping. The control strategy consists of two feedback control loops : an optimal stiffness control loop and a generalized direct velocity feedback loop for the augmentation of damping. The validity of the proposed control stategy is shown through numerical simulation of flexible mode control of symmetric elastic panels attached to a space-craft.

Bookmark

Share it with SNS

Article Title

Control Strategy Design of Large Space Structures

A Study on the Validity of a Physical Model for Fish Behavior

Nobuo SANNOMIYA, Hiroshi NAKAMINE, Hisaya IWASAKI

pp. 14-20

Abstract

In this paper, a physical model is presented for describing the behavior of fish in a water tank. The system equation includes several nonlinear terms representing the main causes for fish motion, which are introduced under the physical consideration. The model parameters are estimated by applying the least squares algorithm. It is observed from a water tank experiment that, in the case of small school, an individual acts as a leader and the others as followers. The parameter values estimated reflect the role of each individual in the school. Three models are proposed as an appropriate functional form of the interactive force. The best form is determined by examining a simulation result for the behavior of fish school encountered by a leader net.

Bookmark

Share it with SNS

Article Title

A Study on the Validity of a Physical Model for Fish Behavior

Decomposition Algorithm in the Approximate Optimization Method of Geometric Programming

Kaname YOSHIDA

pp. 21-28

Abstract

In this paper, we propose an algorithm to decompose a geometric programming problem into a set of subproblems. Each of the subproblems is constructed with some column vectors that are chosen from the n×m exponent matrix of the given problem to satisfy each of the following :
(1) the convex hull of the selected n+1 vectors contains zero vector as an interior point;
(2) every column vector of the exponent matrix must be included in some set which consists of n+1 vectors that satisfy the condition (1).
The present paper represents a systematic choice algorithm of the column vectors. As the selection method is a pivoting method, the complexity of computation is very small.
At last some examples are dealt with to show the efficiency of this algorithm.

Bookmark

Share it with SNS

Article Title

Decomposition Algorithm in the Approximate Optimization Method of Geometric Programming

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.