LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

Fast Computation of Tight Funnels for Piecewise Polynomial Systems

Photo by nhoizey from unsplash

Funnels are widely used in safety-critical applications such as robust motion planning as conservative bounds for possible state deviations due to disturbances. However, the problem of finding a tight funnel… Click to show full abstract

Funnels are widely used in safety-critical applications such as robust motion planning as conservative bounds for possible state deviations due to disturbances. However, the problem of finding a tight funnel has been a challenging topic due to the complexity of the Hamilton-Jacobi partial differential equation that appears when solving the problem. In this letter, we consider the funnel-finding problem for piecewise polynomial systems, with which we can approximate a considerably wider range of real-world dynamic systems, compared to global polynomial approximations. We propose techniques that reduce the computational burden of the problem and improve the tightness of the obtained funnel. Through experimental results using three different example systems, we confirm that the proposed method yields a tighter funnel in a shorter time, compared to competing polynomial-based funnel-computing methods.

Keywords: problem; polynomial systems; fast computation; piecewise polynomial; tight funnels; computation tight

Journal Title: IEEE Control Systems Letters
Year Published: 2022

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.