学科分类
/ 1
4 个结果
  • 简介:Lowgainfeedbackreferstocertainfamiliesofstabilizingstatefeedbackgainsthatareparameterizedinascalarandgotozeroasthescalardecreasestozero.Lowgainfeedbackwasinitiallyproposedtoachievesemi-globalstabilizationoflinearsystemssubjecttoinputsaturation.Itwasthencombinedwithhighgainfeedbackindifferentwaysforsolvingvariouscontrolproblems.Theresultingfeedbacklawsarereferredtoaslow-and-highgainfeedback.Sincetheintroductionoflowgainfeedbackinthecontextofsemi-globalstabilizationoflinearsystemssubjecttoinputsaturation,therehasbeenefforttodevelopalternativemethodsforlowgaindesign,tocharacterizekeyfeaturesoflowgainfeedback,andtoexplorenewapplicationsofthelowgainandlow-and-highgainfeedback.Thispaperreviewsthedevelopmentsinlowgainandlow-and-highgainfeedbackdesigns.

  • 标签: 增益控制 状态反馈 收入 高增益反馈 半线性系统 综述
  • 简介:Thispaperinvestigatestheinfluenceoflow-carbonpoliciesonchannelcoordinationforatwo-echelonsupplychainconsistingofonesupplierandoneretailer.Fourdifferentmodelsareconsidered:thebasicmodel,thecarbonemissionmodel,thecarbonemissiontradingmodelandthecarbontaxmodel.Wefindthatthegovernmentpolicyonallcarbonemissionmodelsisnotuniversalamongthefirmsaswellasthecustomers.Thecarbonemissiontradingpolicyisalwaysbetterthanthecarbonemissionpolicyandthecarbontaxpolicywhentheallocatedcarbonemissionquotasaregreaterthanthecarbonemissions.Thecarbonemissiontradingpolicyisprovedtobeaneffectivemechanismwhichcanmotivatethesupplychaintoreducecarbonemissions.Undercertainconditions,thesupplychainprefersthecarbonemissiontradingpolicywithhighercarbonpricetootherpolicies.IntheframeworkofStackelberggamewiththesupplierastheleader,foreachcarbonpolicy,thepaperpresentscoordinationmechanismwiththeall-unitwholesalequantitydiscountcontract(AWQD).Weanalyzeandcomparetheinfluenceoflow-carbonpoliciesonchannelcoordinationforthefourlow-carbonpolicies.Numericalexperimentsareconductedtoexamineourfindings.

  • 标签: 供应链 低碳 STACKELBERG博弈 排放交易 排放模型 碳排放
  • 简介:A。Kaneko和K。Ota证明了那为一最低限度地(n,λ)连接了图G,如果|G|=p≥3n-1,然后e(G)≤nλ(|G|-n);并且如果e(G)=nλ(|G|-n),当时,G对图K_同形(n,p-n)从完全的由两部组成的图K_被获得的~λ(n,p-n)由用λ代替每个边多重边;如果3n-1≥|G|≥n+1,然后e(G)≤λ(|G|+n)~2/8。在这篇论文,我们决定所有最低限度地(n,λ)与顺序p和最大的尺寸λ(p+n连接了图)为3n-1≥p≥n+的~2/81为3n-1≥p≥n+1。

  • 标签: 连通性 最小连接图 同构图 图论