國立虎尾科技大學 |

High Dimensional Reachability Analysis : = Addressing the Curse of Dimensionality in Formal Verification.

Record Type:	Language materials, manuscript : Monograph/item
Title/Author:	High Dimensional Reachability Analysis :/
Reminder of title:	Addressing the Curse of Dimensionality in Formal Verification.
Author:	Chen, Mo.
Description:	1 online resource (167 pages)
Notes:	Source: Dissertation Abstracts International, Volume: 79-05(E), Section: B.
Contained By:	Dissertation Abstracts International79-05B(E).
Subject:	Artificial intelligence. -
Online resource:	click for full text (PQDT)
ISBN:	9780355576726

High Dimensional Reachability Analysis : = Addressing the Curse of Dimensionality in Formal Verification.
Chen, Mo.

High Dimensional Reachability Analysis :Addressing the Curse of Dimensionality in Formal Verification. - 1 online resource (167 pages)

Source: Dissertation Abstracts International, Volume: 79-05(E), Section: B.

Thesis (Ph.D.)--University of California, Berkeley, 2017.

Includes bibliographical references

Automation is becoming pervasive in everyday life, and many automated systems, such as unmanned aerial systems, autonomous cars, and many types of robots, are complex and safety-critical. Formal verification tools are essential for providing performance and safety guarantees for these systems. In particular, reachability analysis has previously been successfully applied to small scale control systems with general nonlinear dynamics under the influence of disturbances. Its exponentially scaling computational complexity, however, makes analyzing more complex, large scale systems intractable. Alleviating computation burden is in general a primary challenge in formal verification.

Electronic reproduction.
Ann Arbor, Mich. :
ProQuest,
2018

Mode of access: World Wide Web

ISBN: 9780355576726Subjects--Topical Terms:

559380
Artificial intelligence.
Index Terms--Genre/Form:

554714
Electronic books.

High Dimensional Reachability Analysis : = Addressing the Curse of Dimensionality in Formal Verification.
LDR:02729ntm a2200349Ki 4500 001 916794
005 20180928111501.5
006 m o u
007 cr mn||||a|a||
008 190606s2017 xx obm 000 0 eng d
020 $a 9780355576726
035 $a (MiAaPQ)AAI10607827
035 $a (MiAaPQ)berkeley:17172
035 $a AAI10607827
040 $a MiAaPQ $b eng $c MiAaPQ $d NTU
100 1 $a Chen, Mo. $3 1190632
245 1 0 $a High Dimensional Reachability Analysis : $b Addressing the Curse of Dimensionality in Formal Verification.
264 0 $c 2017
300 $a 1 online resource (167 pages)
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
500 $a Source: Dissertation Abstracts International, Volume: 79-05(E), Section: B.
500 $a Adviser: Claire J. Tomlin.
502 $a Thesis (Ph.D.)--University of California, Berkeley, 2017.
504 $a Includes bibliographical references
520 $a Automation is becoming pervasive in everyday life, and many automated systems, such as unmanned aerial systems, autonomous cars, and many types of robots, are complex and safety-critical. Formal verification tools are essential for providing performance and safety guarantees for these systems. In particular, reachability analysis has previously been successfully applied to small scale control systems with general nonlinear dynamics under the influence of disturbances. Its exponentially scaling computational complexity, however, makes analyzing more complex, large scale systems intractable. Alleviating computation burden is in general a primary challenge in formal verification.
520 $a This thesis presents ways to tackle this "curse of dimensionality" from multiple fronts, bringing tractable verification of complex, practical systems such as unmanned aerial systems, autonomous cars and robots, and biological systems closer to reality. The theoretical contributions pertain to Hamilton-Jacobi (HJ) reachability analysis, with applications to unmanned aerial system. In addition, this thesis also explores two frontiers of HJ reachability by combining the formal guarantees of reachability with the computational advantages of optimization and machine learning, and with fast motion planning algorithms commonly used in robotics. The potential and benefits of the theoretical advances are demonstrated in numerous practical applications.
533 $a Electronic reproduction. $b Ann Arbor, Mich. : $c ProQuest, $d 2018
538 $a Mode of access: World Wide Web
650 4 $a Artificial intelligence. $3 559380
650 4 $a Robotics. $3 561941
655 7 $a Electronic books. $2 local $3 554714
690 $a 0800
690 $a 0771
710 2 $a ProQuest Information and Learning Co. $3 1178819
710 2 $a University of California, Berkeley. $b Electrical Engineering & Computer Sciences. $3 845564
773 0 $t Dissertation Abstracts International $g 79-05B(E).
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10607827 $z click for full text (PQDT)