Search Sites

Transactions of the Institute of Systems, Control and Information Engineers Vol. 35 (2022), 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. 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. 35 (2022), No. 8

Local Search Methods for Min-Max Clearing Problem

Qiwei Sun, Toshiyuki Miyamoto, Shoichi Kitamura, Ayako Taniguchi-Matsuoka, Kento Naito, Kazuyuki Mori, Yoshio Izui

pp. 193-201

Abstract

In the ongoing power system reform in Japan, the division of transmission and distribution is separated from the former general electric utility and became a general power transmission and distribution business operator. After the reform, the power transmission and distribution business operators will procure reserve power from the reserve market. We have formulated the clearing problem in the reserve market as a 0-1 integer programming problem. This problem can be viewed as a Min-Max set multi-cover problem. Since the set covering problem belongs NP-hard, it is not easy to solve large-scale problems in practical time. In this paper, we propose a greedy solution and local search solution to the Min-Max set multi-cover problem and evaluate its performance by numerical experiments.

Readers Who Read This Article Also Read

Bookmark

Share it with SNS

Article Title

Local Search Methods for Min-Max Clearing Problem

On Distributed Event-triggered Controller with Aperiodic Event Detection for Finite-time Consensus of Multi-agent Systems

Ziyang Cheng, Changqin Quan, Kohei Mori, Sheng Cao, Zhiwei Luo

pp. 202-208

Abstract

This paper provides a distributed event-triggered controller with aperiodic event detection for finite-time consensus of multi-agent systems. In previous research, event-triggered control for finite-time consensus of multi-agent systems still needs continuous communication to update the trigger function. Therefore, we introduce a trigger function based on broadcast state which only updates at each event along with the controller. It is proved that such event-triggered controller satisfies the requirements of finite-time consensus. And the system does not exhibit Zeno behavior if and only if the precision of state error is lower bounded. Simulation results show that although aperiodic event detection has greater estimation error in consensus time, it saves more computation and communication resource compared with continuous event detection.

Readers Who Read This Article Also Read

Bookmark

Share it with SNS

Article Title

On Distributed Event-triggered Controller with Aperiodic Event Detection for Finite-time Consensus of Multi-agent Systems

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.