Abstract
This study proposes a computationally efficient algorithm that characterises the set of allowable real parametric uncertainties while ensuring the desired output specifications are satisfied for rational systems. Along with the scaled main loop theorem, the proposed approach reformulates this NP-hard problem by using the skewed structured singular value ν, whose upper and lower bounds can be efficiently computed by existing algorithms and software. A short discussion on the extension to a multi-agent system is also included. Two numerical examples of pharmaceutical crystallisation and nasal spray demonstrate the effectiveness of the proposed algorithm.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
