Search Sites

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

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. 5 (1992), No. 8

Collision Avoidance among Movile Robots Mobing on the Route Crossing and Joining

Mamoru SAITO, Toshihiro TSUMURA

pp. 309-316

Abstract

The problem of collision avoidance among mobile robots moving along crossing and joining paths is formulated as a motion planning problem in terms of the velocity vector modification. In this paper, a local approach based on a nonlinear programming is applied to solve this problem. Here, the velocity vector constraint for robots are set up using the relative position and velocity information of neighboring robots. The desired velocity vector, which enables robots to navigate without collision, is given as the optimal solution of objective function under this velocity vector constraint. This method is implemented using both experimental robots system and computer simulated one. From the results, it is shown that the experimental robots achieves acceptable performance both in case of crossing and joinig. The feasibility and effectiveness of our method are also discussed through the simulation results.

Bookmark

Share it with SNS

Article Title

Collision Avoidance among Movile Robots Mobing on the Route Crossing and Joining

Concurrency and State Feedbacks in Petri Nets with External Input Places

Shigemasa TAKAI, Toshimitsu USHIO, Shinzo KODAMA

pp. 317-324

Abstract

Concurrency is a very important problem in real-time discrete-event systems, and has a crucial effect on control. In this paper, we consider concurrent discrete-event systems modeled by Petri nets with external input places, with a control specification given in terms of a predicate on the set of all reachable markings. First, we derive a simpler condition for the unique existence of the maximally permissive feedback which can be checked without constructing the set of permissive feedbacks. Next, we obtain a necessary and sufficient condition for concurrency to have no effect on the set of permissive feedbacks. And we study the relationship between these two properties. Moreover, we demonstrate synthesis of the unique maximally permissive feedback for a simple manufacturing system.

Bookmark

Share it with SNS

Article Title

Concurrency and State Feedbacks in Petri Nets with External Input Places

Some Linear Complexity Profiles of Finite Sequences

Masakatu MORII, Masao KASAHARA

pp. 325-330

Abstract

One of the most them interesting them in modern crytology is the generating of the highly unpredictable pseudo-random sequences. It is difficult that we give the practical definition of the highly unpredictable pseudo-random sequences. However some measures for the unpredictability, or equivalently the randomness, of finite sequences have been proposed. The linear complexity is one of such measures.
In this paper we shall give the notes on the growth properties of linear complexity. Especially we shall present and discuss new classes of sequences with the interesting growth property of linear complexity.

Bookmark

Share it with SNS

Article Title

Some Linear Complexity Profiles of Finite Sequences

Sensitivity Shaping by Using Time-Delays

Kazuo YAMANAKA

pp. 331-337

Abstract

Some results are presented concerning use of time-delays as controller for sensitivity shaping in a control system with stable plant represented by a strictly proper rational transfer function. Suppose that the desired shaping can be performed by some fictitious stable controller represented by a, proper rational transfer function. Then, a set of time-delays connected in parallel can replace the fictitious controller without making the change of the shape of sensitivity function exceed a prescribed allowance. In the case where the plant possibly contains small perturbation that allows the plant to remain stable and strictly proper, a set of time-delays can shape the sensitivity function so that the control system possesses stability robustness against such perturbation. Furthermore, small perturbation in the controller parameters like delay-times causes no closed-loop instability nor remarkable change in the shape of the sensitivity function.

Bookmark

Share it with SNS

Article Title

Sensitivity Shaping by Using Time-Delays

Image Restoration in Frequency Domain Using Adaptive Digital Filters

Hiroshi KINJO, Sigeru OMATU, Tetsuhiko YAMAMOTO

pp. 338-345

Abstract

In this paper, we propose an estimation method of system parameters for a two-dimensional noisy image and apply the estimation results to restoration of the noisy image data. The unknown parameters required for orthogonal transform are first roughly estimated by the Yule-Walker equation. Using these estimated parameters, the noisy image data are transformed into frequency domain by FFT. The system parameters of the two-dimensional image are estimated by using adaptive digital filter (ADF) in frequency domain. The noisy image in frequency domain is restored by a filtering algorithm based on the system parameters and innovation process obtained by the ADF. The restored image in frequency domain is transformed into spatial domain by inverse FFT. Simulation results show the effectiveness of the present algorithm in comparison with conventional methods.

Bookmark

Share it with SNS

Article Title

Image Restoration in Frequency Domain Using Adaptive Digital Filters

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.