메뉴 건너뛰기




Volumn 1, Issue , 2004, Pages 485-490

A probabilistic approach to controllability/reachability analysis of hybrid systems

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONTROLLABILITY; DATA REDUCTION; MATHEMATICAL MODELS; MATRIX ALGEBRA; POLYNOMIALS; PROBLEM SOLVING; THEOREM PROVING; VECTORS;

EID: 14344263184     PISSN: 07431546     EISSN: 25762370     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (11)

References (9)
  • 2
    • 0034291822 scopus 로고    scopus 로고
    • Observability and controllability of piecewise affine and hybrid systems
    • A. Bemporad er al.: Observability and controllability of piecewise affine and hybrid systems, IEEE TAC, 45, pp. 1864-1876 (2000)
    • (2000) IEEE TAC , vol.45 , pp. 1864-1876
    • Bemporad, A.1
  • 3
    • 84974658241 scopus 로고    scopus 로고
    • Optimization-based verification and stability characterization of piecewise affine and hybrid systems
    • A. Bemporad et al.: Optimization-based verification and stability characterization of piecewise affine and hybrid systems, Hybrid Systems: Computation and Control, pp. 45-58 (2000)
    • (2000) Hybrid Systems: Computation and Control , pp. 45-58
    • Bemporad, A.1
  • 4
    • 85064558161 scopus 로고    scopus 로고
    • Controllability of sampled-data piecewise affine systems
    • S. Azuma and I. Imura: Controllability of sampled-data piecewise affine systems, Proc. of IFAC Conf. on ADHS, pp. 129-134 (2003)
    • (2003) Proc. of IFAC Conf. on ADHS , pp. 129-134
    • Azuma, S.1    Imura, I.2
  • 5
    • 1242287570 scopus 로고    scopus 로고
    • Optimal control of sampled-data piecewise affine systems
    • J. Imura: Optimal control of sampled-data piecewise affine systems, Automatica, 40, pp. 661-669 (2004)
    • (2004) Automatica , vol.40 , pp. 661-669
    • Imura, J.1
  • 6
    • 8744300716 scopus 로고    scopus 로고
    • Probabilistic controllability analysis of sampled-data/discrete-time piecewise affine systems
    • S. Azuma and J. Imura: Probabilistic controllability analysis of sampled-data/discrete-time piecewise affine systems, Proc. of 2004 ACC, pp. 2528-2533 (2004)
    • (2004) Proc. of 2004 ACC , pp. 2528-2533
    • Azuma, S.1    Imura, J.2
  • 7
    • 0000872569 scopus 로고    scopus 로고
    • Probabilistic robustness analysis: Explicit bounds for the minimum number of samples
    • R. Tempo et al.: Probabilistic robustness analysis: Explicit bounds for the minimum number of samples, Systems & Control Lett., 30, pp. 237-242 (1997)
    • (1997) Systems & Control Lett. , vol.30 , pp. 237-242
    • Tempo, R.1
  • 8
    • 0002779393 scopus 로고    scopus 로고
    • Randomized algorithms for robust control analysis and synthesis have polynomial complexity
    • P. Khargonekar and A. Tikku: Randomized algorithms for robust control analysis and synthesis have polynomial complexity, Proc. of 35th CDC, pp. 3470-3475 (1996)
    • (1996) Proc. of 35th CDC , pp. 3470-3475
    • Khargonekar, P.1    Tikku, A.2
  • 9
    • 14344259892 scopus 로고    scopus 로고
    • The geometric bounding toolbox, User's manual & reference
    • S. M. Veres: The geometric bounding toolbox, User's manual & reference, SysBrain, UK (2001)
    • (2001) SysBrain, UK
    • Veres, S.M.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.