default search action
Takehito Azuma
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c15]Takehito Azuma, Sodai Yokota:
Least Squares Estimation of Polynomial AR Models to Forecast Short Term Power Demand. ASCC 2024: 1420-1423 - 2023
- [c14]Takehito Azuma, Kei Kikuchi:
Short term demand forecasting using polynomial ARX models based on least squares methods. ICST 2023: 1-4
2010 – 2019
- 2013
- [c13]Takehito Azuma, Tatsuhiko Watanabe:
Stability analysis of load frequency control systems with real-time pricing and external signals. ICST 2013: 837-841 - 2010
- [c12]Takehito Azuma, Masachika Kurata, Noriko Takahashi, Shuichi Adachi:
Estimation and Robustness Analysis of Protein Networks for Cell Cycle Systems. CCA 2010: 512-517
2000 – 2009
- 2005
- [c11]Hiroyuki Hirano, Masakazu Mukai, Takehito Azuma, Masayuki Fujita
:
Optimal control of discrete-time linear systems with network-induced varying delay. ACC 2005: 1419-1424 - [c10]Takehito Azuma, Hiyoyuki Naito, Masayuki Fujita
Experimental verification of stabilizing congestion controllers using the network testbed. ACC 2005: 1841-1846 - 2004
- [c9]Masakazu Mukai, Takehito Azuma, Masayuki Fujita:
A collision avoidance control for multi-vehicle using PWA/MLD hybrid system representation. CCA 2004: 872-877 - [c8]Yasunori Kawai, Hiroyuki Hirano, Takehito Azuma, Masayuki Fujita:
Visual feedback control of an unmanned planar blimp system with self-scheduling parameter via receding horizon approach. CCA 2004: 1603-1608 - 2003
- [c7]Takehito Azuma, Seiichi Sagara, Masayuki Fujita, Kenko Uchida:
Output feedback control synthesis for linear time-delay systems via infinite-dimensional LMI approach. CDC 2003: 4026-4031 - [c6]Masakazu Mukai, Akira Kojima, Takehito Azuma, Masayuki Fujita:
A min-max model predictive control for a class of hybrid dynamical systems. CIRA 2003: 694-699 - [c5]Masakazu Mukai, Takehito Azuma, Akira Kojima, Masayuki Fujita:
Approximate robust receding horizon control for piecewise linear systems via orthogonal partitioning. ECC 2003: 2020-2025 - 2002
- [j2]Takehito Azuma, Kojiro Ikeda, Taku Kondo, Kenko Uchida:
Memory state feedback control synthesis for linear systems with time delay via a finite number of linear matrix inequalities. Comput. Electr. Eng. 28(3): 217-228 (2002) - [c4]Masakazu Mukai, Takehito Azuma, Masayuki Fujita:
Robust receding horizon control for piecewise linear systems based on constrained positively invariant. ACC 2002: 2348-2353 - [c3]Yasunori Kawai, Takehito Azuma, Masayuki Fujita:
Stabilizing receding horizon H∞ control for LTV systems using extended terminal inequality condition. CDC 2002: 3452-3457 - 2001
- [j1]Kojiro Ikeda, Takehito Azuma, Kenko Uchida:
Infinite-dimensional LMI approach to analysis and synthesis for linear time-delay systems. Kybernetika 37(4): 505-520 (2001) - [c2]Yasunori Kawai, Takehito Azuma, Masayuki Fujita:
Output feedback design for LTV systems via stabilizing receding horizon H∞ control with a terminal penalty. CDC 2001: 4298-4299
1990 – 1999
- 1999
- [c1]Takehito Azuma, Kojiro Ikeda, Kenko Uchida:
Infinite-dimensional LMI approach to H∞ control synthesis for linear systems with time delay. ECC 1999: 3655-3660
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-12 23:31 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: