Alban Grastien
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Alban Grastien has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Lachlan Blackhall
School of Engineering College of Engineering and Computer Science Battery Storage and Grid Integration Program The Australian National University
2 shared publications - Priscilla Kan John
NICTA∗and Australian National University; Canberra, ACT 02 00, Australia
2 shared publications - Daniel Harabor
Univ Melbourne, 115 Batman St, Melbourne, Vic 3003, Australia
1 shared publication - David John Hill
Department of Electrical and Computer Systems Engineering, Monash University, Clayton, VIC, Australia
1 shared publication - Dindar Öz
Software Engineering Department, Yasar University, Izmir, Turkey
1 shared publication - Gianluca Torta
Univerisità di Torino
1 shared publication
Latest Publications
- 26 May 2016
- Published by AI Access Foundation in Journal of Artificial Intelligence Research
- Vol. 56, 89-118
Optimal Any-Angle Pathfinding In Practice
- 26 May 2016
- Published by AI Access Foundation in Journal of Artificial Intelligence Research
- Vol. 56, 89-118
Optimal Any-Angle Pathfinding In Practice
- Open Access
An example illustrating the imprecision of the efficient approach for diagnosis of Petri nets via integer linear programming
This document demonstrates that the efficient approach for diagnosis of Petri nets via integer linear programming may be unable to detect a fault even if the system is diagnosable.
Open AccessAn example illustrating the imprecision of the efficient approach for diagnosis of Petri nets via integer linear programming
This document demonstrates that the efficient approach for diagnosis of Petri nets via integer linear programming may be unable to detect a fault even if the system is diagnosable.
- Open Access
- 11 October 2010
- Published by PHM Society in Annual Conference of the PHM Society
- Vol. 2 (2)
Reformulation for the Diagnosis of Discrete-Event Systems
Diagnosis is traditionally defined on a space of hypotheses (typically, all the combinations of zero or more possible faults).In the present paper, we argue that a suitable reformulation of this hypothesis space can lead to more efficient diagnostic algorithms and more compact diagnoses, most notably by exploiting opportunities for various forms of model abstraction. We also study several formal properties related to the correctness and precision of the diagnoses obtained through reformulation.
- 11 October 2010
- Published by PHM Society in Annual Conference of the PHM Society
- Vol. 2 (2)
Open AccessReformulation for the Diagnosis of Discrete-Event Systems
Diagnosis is traditionally defined on a space of hypotheses (typically, all the combinations of zero or more possible faults).In the present paper, we argue that a suitable reformulation of this hypothesis space can lead to more efficient diagnostic algorithms and more compact diagnoses, most notably by exploiting opportunities for various forms of model abstraction. We also study several formal properties related to the correctness and precision of the diagnoses obtained through reformulation.
- Open Access
- 11 October 2010
- Published by PHM Society in Annual Conference of the PHM Society
- Vol. 2 (2)
Synthesis of a Distributed and Accurate Diagnoser
The complex behaviour of large discrete event systems makes such systems difficult to diagnose. Using decentralised techniques helps limit combinatorial explosion but is not sufficient. Often, the complexity of the diagnosis is dependent on how components in the system are connected and the number of connections between them. We propose to augment a decentralized junction tree- based approach by ignoring some connections on the system. This helps reduce the complexity, and hence the cost, of the diagnostic reasoning required. However accuracy of the diagnosis is also reduced. We get around this problem by performing an off-line analysis to determine which connections can be safely ignored.
- 11 October 2010
- Published by PHM Society in Annual Conference of the PHM Society
- Vol. 2 (2)
Open AccessSynthesis of a Distributed and Accurate Diagnoser
The complex behaviour of large discrete event systems makes such systems difficult to diagnose. Using decentralised techniques helps limit combinatorial explosion but is not sufficient. Often, the complexity of the diagnosis is dependent on how components in the system are connected and the number of connections between them. We propose to augment a decentralized junction tree- based approach by ignoring some connections on the system. This helps reduce the complexity, and hence the cost, of the diagnostic reasoning required. However accuracy of the diagnosis is also reduced. We get around this problem by performing an off-line analysis to determine which connections can be safely ignored.
- 1 January 2009
- Published by Elsevier in IFAC Proceedings Volumes
- Vol. 42 (8) , 1492-1497
Diagnosability of Networks of Hybrid Systems
- 1 January 2009
- Published by Elsevier in IFAC Proceedings Volumes
- Vol. 42 (8) , 1492-1497
Diagnosability of Networks of Hybrid Systems
- 1 January 2009
- Published by Elsevier in IFAC Proceedings Volumes
- Vol. 42 (8) , 983-988
Diagnosing Hybrid Dynamical Systems
- 1 January 2009
- Published by Elsevier in IFAC Proceedings Volumes
- Vol. 42 (8) , 983-988
Diagnosing Hybrid Dynamical Systems