union
PURPOSE
UNION convex union computation
SYNOPSIS
function [Pu,how] = union(Pn, Options)
DESCRIPTION
CROSS-REFERENCE INFORMATION
This function calls:
- length LENGTH Returns number of regions over which the explicit control law is defined
- double DOUBLE Function used to access internal properties of the given polytope
- end END Returns the last element in a given polytope array
- isconvex ISCONVEX Checks if a polytope array forms a convex union
- isfulldim ISFULLDIM Checks if a polytope is full dimensional
- length LENGTH Returns number of elements in a polytope array
- polytope POLYTOPE Default constructor for the POLYTOPE object
- chebyball_f CHEBYBALL_F Computes center and radius of the largest ball inscribed in a polytope
- reduce REDUCE Reduces the polytope by removing redundant inequalities
- size SIZE Returns size of the given polytope object
- mpt_error MPT_ERROR Function called if MPT toolbox is not initialized
- mpt_solveLPi MPT_SOLVELPi Interface to various LP solvers (version without errorchecks)
This function is called by:
- or OR Convex union of n polytopes
- mpt_infsetPWA MPT_INFSETPWA Computes (robust) positive invariant subset for PWA systems
- mpt_searchTree MPT_SEARCHTREE Computes a search-tree for a given explicit solution
- mpt_greedyMerging MPT_GREEDYMERGING Greedy merging of polyhedra
- mpt_iterativePWA MPT_ITERATIVEPWA Computes a time-optimal or low-complexity explicit controller for PWA systems
- mpt_mixedMinTime MPT_MIXEDMINTIME Computes minimum time controller for systems with discrete and continuous inputs
- mpt_mpqp MPT_MPQP Explicitly solves the given quadratic program (QP)
Generated on Thu 30-Mar-2006 10:26:47 by m2html © 2003