### Abstract

Original language | English |
---|---|

Title of host publication | 2016 European Control Conference (ECC) |

Place of Publication | Piscataway, NJ |

Publisher | IEEE |

Pages | 849-854 |

Number of pages | 6 |

ISBN (Electronic) | 9781509025916 |

DOIs | |

Publication status | Published - 9 Jan 2017 |

Event | 2016 European Control Conference - Aalborg, Denmark Duration: 29 Jun 2016 → 1 Jul 2017 |

### Conference

Conference | 2016 European Control Conference |
---|---|

Abbreviated title | ECC16 |

Country | Denmark |

City | Aalborg |

Period | 29/06/16 → 1/07/17 |

### Fingerprint

### Keywords

- bipartite graph
- mathematical model
- electronic mail
- differential equations
- NP-hard problem
- sensors

### Cite this

*2016 European Control Conference (ECC)*(pp. 849-854). Piscataway, NJ: IEEE. https://doi.org/10.1109/ECC.2016.7810395

}

*2016 European Control Conference (ECC).*IEEE, Piscataway, NJ, pp. 849-854, 2016 European Control Conference, Aalborg, Denmark, 29/06/16. https://doi.org/10.1109/ECC.2016.7810395

**Minimum controller substructure for generic arbitrary pole placement : multicommodity flow and TSP based formulations.** / Kotoky, Atreya; Mahajan, Ashutosh; Arulselvan, Ashwin; Belur, Madhu N.; Kalaimani, Rachel K.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution book

TY - GEN

T1 - Minimum controller substructure for generic arbitrary pole placement

T2 - multicommodity flow and TSP based formulations

AU - Kotoky, Atreya

AU - Mahajan, Ashutosh

AU - Arulselvan, Ashwin

AU - Belur, Madhu N.

AU - Kalaimani, Rachel K.

PY - 2017/1/9

Y1 - 2017/1/9

N2 - This paper deals with finding a 'least interaction' controller that generically achieves pole placement, given a actuator-sensor interaction possibility for the controller. The structure of the plant and the controller are modeled as an undirected and bipartite graph. Assuming that the plant/controller structures are specified, we find a minimum controller substructure within the specified controller structure such that the controller substructure allows generic eigenvalue assignability. The minimum is in the sense that the bipartite graph consisting of the proposed controller has the minimum number of edges. The complexity of a brute-force algorithm to identify a minimum controller substructure would be exponential and hence we propose two formulations for solving this problem, using recent results about equivalence of generic pole-assignability and covering of plant edges using cycles. The first uses multi-commodity flow networks to include all plant edges in some cycle using the least number of controller edges. We show that an integer solution to this formulation gives a minimum controller substructure for arbitrary pole placement problem. Since the problem of finding a feasible integer flow in multicommodity networks is NP-complete, there is ample reason that identifying a minimum controller substructure is NP-hard. The second formulation uses the framework of travelling salesman with profits (TSP with profits) to cover all vertices of the bipartite graph by cycles using the least number of controller edges. The TSP-with-profits problem too belongs to the class of NP-hard problems. We show that our formulation is equivalent to the so-called Generalized Travelling Salesman Problem (GTSP) thus allowing branch-cut algorithms developed for GTSP problems.

AB - This paper deals with finding a 'least interaction' controller that generically achieves pole placement, given a actuator-sensor interaction possibility for the controller. The structure of the plant and the controller are modeled as an undirected and bipartite graph. Assuming that the plant/controller structures are specified, we find a minimum controller substructure within the specified controller structure such that the controller substructure allows generic eigenvalue assignability. The minimum is in the sense that the bipartite graph consisting of the proposed controller has the minimum number of edges. The complexity of a brute-force algorithm to identify a minimum controller substructure would be exponential and hence we propose two formulations for solving this problem, using recent results about equivalence of generic pole-assignability and covering of plant edges using cycles. The first uses multi-commodity flow networks to include all plant edges in some cycle using the least number of controller edges. We show that an integer solution to this formulation gives a minimum controller substructure for arbitrary pole placement problem. Since the problem of finding a feasible integer flow in multicommodity networks is NP-complete, there is ample reason that identifying a minimum controller substructure is NP-hard. The second formulation uses the framework of travelling salesman with profits (TSP with profits) to cover all vertices of the bipartite graph by cycles using the least number of controller edges. The TSP-with-profits problem too belongs to the class of NP-hard problems. We show that our formulation is equivalent to the so-called Generalized Travelling Salesman Problem (GTSP) thus allowing branch-cut algorithms developed for GTSP problems.

KW - bipartite graph

KW - mathematical model

KW - electronic mail

KW - differential equations

KW - NP-hard problem

KW - sensors

UR - http://www.ecc16.eu/index.shtml

U2 - 10.1109/ECC.2016.7810395

DO - 10.1109/ECC.2016.7810395

M3 - Conference contribution book

SP - 849

EP - 854

BT - 2016 European Control Conference (ECC)

PB - IEEE

CY - Piscataway, NJ

ER -