Array
(
[page] => 87
[item_count] => 2086
[items_per_page] => 15
[data] => Array
(
[0] => Array
(
[vysledek_id] => 55345
[vysledek_druh_id] => CHAPT
[ex_vysledek_id] => 70359
[vysledek_rok] => 2007
[nazev] => Design Optimization of Mechatronic systems
[nazev_orig] => Design Optimization of Mechatronic systems
[duvernost_udaju_id] => S
[popis] => Mechatronic conceptions are most frequently characterized as synergistic conjunction of the mechanics, electrotechnics and computer science. Computer science as a platform of the realization of control algorithms especially increasingly runs the soft computing algorithms. Soft computing differs from conventional (hard) computing in the basic principle: it exploits the tolerance for imprecision, uncertainty and partial truth to achieve tractability, robustness and low solution cost. The most important components of soft computing are fuzzy logic, neural network theory, probabilistic reasoning, genetic algorithm, chaos theory and parts of machine learning theory. Fundamental issue is that the principal contributions of cited components are complementary, not competitive (leading on hybrid systems creation, etc.).
The survey of the most interesting ideas of learning used in soft computing is introduced in this contribution.
[popis_orig] => Mechatronic conceptions are most frequently characterized as synergistic conjunction of the mechanics, electrotechnics and computer science. Computer science as a platform of the realization of control algorithms especially increasingly runs the soft computing algorithms. Soft computing differs from conventional (hard) computing in the basic principle: it exploits the tolerance for imprecision, uncertainty and partial truth to achieve tractability, robustness and low solution cost. The most important components of soft computing are fuzzy logic, neural network theory, probabilistic reasoning, genetic algorithm, chaos theory and parts of machine learning theory. Fundamental issue is that the principal contributions of cited components are complementary, not competitive (leading on hybrid systems creation, etc.).
The survey of the most interesting ideas of learning used in soft computing is introduced in this contribution.
[klicova_slova] => control algorithm, Q-learning, neural network
[klicova_slova_orig] => control algorithm, Q-learning, neural network
[url] =>
[oecd_obor_id] => 20204
[odpovedny_utvar_id] => 157
[odpovedny_utvar_nazev] => Institute of Solid Mechanics, Mechatronics and Biomechanics
[odpovedny_utvar_zkratka] => ISMMB
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FME
[nadrazena_soucast_nazev] => Faculty of Mechanical Engineering
[originalni_jazyk] => en
[schvalil_id] => 1671
[schvaleno] => 2021-03-03
[vykazovat_riv] => 0
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => BŘEZINA, T.; KRATOCHVÍL, C.; ONDRŮŠEK, Č.
[pocet_tvurcu] => 3
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] =>
[kod_dspace] =>
[rok_vytvoreni] =>
[pocet_zaznamu] =>
[zverejneno] => 1
[prvni_autor] =>
[korespondencni_autor] =>
[posledni_autor] =>
[znamka] =>
[kategorie_nazev] => Publication results
[druh_nazev] => Chapter in a book
[druh_popis] => Chapter in a book
[stav] => Approved
[vysledek_kategorie_id] => PV
[vysledek_system_kategorie_id] => PU
[vysledek_stav_id] => 3
[vlozil] => Informační systém Automat
[upravil] => Informační systém Automat
[ins_uid] => 999999
[upd_uid] => 999999
[ins_ts] => 2025-09-22
[upd_ts] => 2025-09-22
[status] => 9
[identifikator] => ISBN 978-0-8493-9257-3
[identifikator_popis] => ISBN - The Mechatronics Handbook
[riv_dodavka_id] => 98
[riv_dodavka_oznaceni] => RIV10-MSM-26210___
[riv_dodavka_rok] => 2010
[diagnostika_pocet] => 0
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 0
[citace_text] => BŘEZINA, T.; KRATOCHVÍL, C.; ONDRŮŠEK, Č. Design Optimization of Mechatronic systems. In The Mechatronics Handbook. Mechatronic systems. Florida, USA: CRC Press LLC, 2007. 14 p. ISBN: 978-0-8493-9257-3.
[citace_html] => BŘEZINA, T.; KRATOCHVÍL, C.; ONDRŮŠEK, Č. Design Optimization of Mechatronic systems. In The Mechatronics Handbook. Mechatronic systems. Florida, USA: CRC Press LLC, 2007. 14 p. ISBN: 978-0-8493-9257-3.
[citace_rtf] =>
[citace_bibtex] =>
[vykazano] =>
[vykazano_aspon_jednou] =>
[identifikacni_kod] =>
[neautorsky_vysledek] => 0
[if] =>
[if_q] =>
[if_m17_q] =>
[if_m25_q] =>
[if_d] =>
[if_m17_d] =>
[if_m25_d] =>
[if_percentil] =>
[if_m17_percentil] =>
[if_m25_percentil] =>
[ais] =>
[ais_m17_q] =>
[ais_m25_q] =>
[ais_m17_d] =>
[ais_m25_d] =>
[ais_m17_percentil] =>
[ais_m25_percentil] =>
[jci] =>
[jci_q] =>
[jci_percentil] =>
[ef] =>
[scopus_sjr] =>
[scopus_sjr_q] =>
[scopus_sjr_d] =>
[nature_index_group] =>
[incites_times_cited] =>
[incites_open_access] =>
[incites_jnci] =>
[incites_is_int_collab] =>
[incites_is_industry_collab] =>
[incites_esi_hot_paper] =>
[incites_esi_highly_cited_paper] =>
[incites_avg_cnci] =>
[incites_avg_percentile] =>
[scival_citations_count] =>
[scival_fwci] =>
[core_rank] => NA
[oecd_tree_oblast_id] => 20000
[oecd_tree_oblast_nazev] => 2. Engineering and Technology
[oecd_tree_obor_id] => 20200
[oecd_tree_obor_nazev] => 2.2 Electrical engineering, Electronic engineering, Information engineering
[oecd_tree_podobor_id] => 20204
[oecd_tree_podobor_nazev] => Robotics and automatic control
[poznamka_metriky] =>
[nazev_en] => Design Optimization of Mechatronic systems
[popis_en] => Mechatronic conceptions are most frequently characterized as synergistic conjunction of the mechanics, electrotechnics and computer science. Computer science as a platform of the realization of control algorithms especially increasingly runs the soft computing algorithms. Soft computing differs from conventional (hard) computing in the basic principle: it exploits the tolerance for imprecision, uncertainty and partial truth to achieve tractability, robustness and low solution cost. The most important components of soft computing are fuzzy logic, neural network theory, probabilistic reasoning, genetic algorithm, chaos theory and parts of machine learning theory. Fundamental issue is that the principal contributions of cited components are complementary, not competitive (leading on hybrid systems creation, etc.).
The survey of the most interesting ideas of learning used in soft computing is introduced in this contribution.
[klicova_slova_en] => control algorithm, Q-learning, neural network
[vysledek_datum] => 2007-11-01T00:00:00+01:00
)
[1] => Array
(
[vysledek_id] => 55413
[vysledek_druh_id] => CHAPT
[ex_vysledek_id] => 53769
[vysledek_rok] => 2005
[nazev] => Mixed Integer Programming vs. Genetic Algorithm Approach to Scheduling Permutation Flow Shop
[nazev_orig] => Mixed Integer Programming vs. Genetic Algorithm Approach to Scheduling Permutation Flow Shop
[duvernost_udaju_id] => S
[popis] => Flow shop scheduling problems represent scheduling a set of jobs (composed of tasks) in shops with a product machine layout. Thus, the jobs have the same manufacturing order. A permutation flow shop scheduling problem (PFSSP) is a special version of the problem where each machine processes the jobs in the same order. In this paper, two different approaches to PFSSP with makespan objective are investigated. First a mixed integer programming model is formulated and it is used for solving the problem by an optimisation package GAMS. Since the problem belongs to NP-complete problems, this approach is limited to smaller instances. Its reasonable bounds are indicated using benchmarks from OR-Library. For large instances, an approach using genetic algorithm is proposed including its appropriate parameter settings. Computational results show a good performance of genetic algorithm. For suitable parameter settings presented in the paper, this approach is able to find the optimal solution almost in all cases or at least a solution very close to optimum when the test is executed several times.
[popis_orig] => Flow shop scheduling problems represent scheduling a set of jobs (composed of tasks) in shops with a product machine layout. Thus, the jobs have the same manufacturing order. A permutation flow shop scheduling problem (PFSSP) is a special version of the problem where each machine processes the jobs in the same order. In this paper, two different approaches to PFSSP with makespan objective are investigated. First a mixed integer programming model is formulated and it is used for solving the problem by an optimisation package GAMS. Since the problem belongs to NP-complete problems, this approach is limited to smaller instances. Its reasonable bounds are indicated using benchmarks from OR-Library. For large instances, an approach using genetic algorithm is proposed including its appropriate parameter settings. Computational results show a good performance of genetic algorithm. For suitable parameter settings presented in the paper, this approach is able to find the optimal solution almost in all cases or at least a solution very close to optimum when the test is executed several times.
[klicova_slova] =>
[klicova_slova_orig] =>
[url] =>
[oecd_obor_id] => 10103
[odpovedny_utvar_id] => 207
[odpovedny_utvar_nazev] => Institute of Automation and Computer Science
[odpovedny_utvar_zkratka] => IACS
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FME
[nadrazena_soucast_nazev] => Faculty of Mechanical Engineering
[originalni_jazyk] => en
[schvalil_id] => 999999
[schvaleno] => 2016-04-15
[vykazovat_riv] => 0
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => ŠEDA, M.
[pocet_tvurcu] => 1
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] =>
[kod_dspace] =>
[rok_vytvoreni] =>
[pocet_zaznamu] =>
[zverejneno] => 1
[prvni_autor] =>
[korespondencni_autor] =>
[posledni_autor] =>
[znamka] =>
[kategorie_nazev] => Publication results
[druh_nazev] => Chapter in a book
[druh_popis] => Chapter in a book
[stav] => Approved
[vysledek_kategorie_id] => PV
[vysledek_system_kategorie_id] => PU
[vysledek_stav_id] => 3
[vlozil] => Informační systém Automat
[upravil] => Informační systém Automat
[ins_uid] => 999999
[upd_uid] => 999999
[ins_ts] => 2025-09-22
[upd_ts] => 2025-09-22
[status] => 9
[identifikator] => ISBN 3-901509-43-7 ISSN 1726-9687
[identifikator_popis] => ISBN - Katalinic, B. (ed.): DAAAM International Scientific Book 2005 ISSN - DAAAM International Scientific Book (AT)
[riv_dodavka_id] =>
[riv_dodavka_oznaceni] =>
[riv_dodavka_rok] =>
[diagnostika_pocet] => 0
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 0
[citace_text] => ŠEDA, M. Mixed Integer Programming vs. Genetic Algorithm Approach to Scheduling Permutation Flow Shop. In Katalinic, B. (ed.): DAAAM International Scientific Book 2005. DAAAM International Scientific Book. DAAAM International Scientific Book. Wien (Austria): DAAAM International, 2005. 12 p. ISBN: 3-901509-43-7. ISSN: 1726-9687.
[citace_html] => ŠEDA, M. Mixed Integer Programming vs. Genetic Algorithm Approach to Scheduling Permutation Flow Shop. In Katalinic, B. (ed.): DAAAM International Scientific Book 2005. DAAAM International Scientific Book. DAAAM International Scientific Book. Wien (Austria): DAAAM International, 2005. 12 p. ISBN: 3-901509-43-7. ISSN: 1726-9687.
[citace_rtf] =>
[citace_bibtex] => @inbook{BUT55413,
author="Miloš {Šeda}",
title="Mixed Integer Programming vs. Genetic Algorithm Approach to Scheduling Permutation Flow Shop",
booktitle="Katalinic, B. (ed.): DAAAM International Scientific Book 2005",
year="2005",
publisher="DAAAM International",
address="Wien (Austria)",
series="DAAAM International Scientific Book",
pages="12",
isbn="3-901509-43-7"
}
[vykazano] =>
[vykazano_aspon_jednou] =>
[identifikacni_kod] =>
[neautorsky_vysledek] => 0
[if] =>
[if_q] =>
[if_m17_q] =>
[if_m25_q] =>
[if_d] =>
[if_m17_d] =>
[if_m25_d] =>
[if_percentil] =>
[if_m17_percentil] =>
[if_m25_percentil] =>
[ais] =>
[ais_m17_q] =>
[ais_m25_q] =>
[ais_m17_d] =>
[ais_m25_d] =>
[ais_m17_percentil] =>
[ais_m25_percentil] =>
[jci] =>
[jci_q] =>
[jci_percentil] =>
[ef] =>
[scopus_sjr] =>
[scopus_sjr_q] =>
[scopus_sjr_d] =>
[nature_index_group] =>
[incites_times_cited] =>
[incites_open_access] =>
[incites_jnci] =>
[incites_is_int_collab] =>
[incites_is_industry_collab] =>
[incites_esi_hot_paper] =>
[incites_esi_highly_cited_paper] =>
[incites_avg_cnci] =>
[incites_avg_percentile] =>
[scival_citations_count] =>
[scival_fwci] =>
[core_rank] => NA
[oecd_tree_oblast_id] => 10000
[oecd_tree_oblast_nazev] => 1. Natural Sciences
[oecd_tree_obor_id] => 10100
[oecd_tree_obor_nazev] => 1.1 Mathematics
[oecd_tree_podobor_id] => 10103
[oecd_tree_podobor_nazev] => Statistics and probability
[poznamka_metriky] =>
[nazev_en] => Mixed Integer Programming vs. Genetic Algorithm Approach to Scheduling Permutation Flow Shop
[popis_en] => Flow shop scheduling problems represent scheduling a set of jobs (composed of tasks) in shops with a product machine layout. Thus, the jobs have the same manufacturing order. A permutation flow shop scheduling problem (PFSSP) is a special version of the problem where each machine processes the jobs in the same order. In this paper, two different approaches to PFSSP with makespan objective are investigated. First a mixed integer programming model is formulated and it is used for solving the problem by an optimisation package GAMS. Since the problem belongs to NP-complete problems, this approach is limited to smaller instances. Its reasonable bounds are indicated using benchmarks from OR-Library. For large instances, an approach using genetic algorithm is proposed including its appropriate parameter settings. Computational results show a good performance of genetic algorithm. For suitable parameter settings presented in the paper, this approach is able to find the optimal solution almost in all cases or at least a solution very close to optimum when the test is executed several times.
[klicova_slova_en] => permutation flow shop, integer programming, NP-complete problems, stochastic heuristics, genetic algorithm
[vysledek_datum] => 2005-10-01T00:00:00+02:00
)
[2] => Array
(
[vysledek_id] => 55427
[vysledek_druh_id] => CHAPT
[ex_vysledek_id] => 71297
[vysledek_rok] => 2007
[nazev] => Four legged robot walking gait generation
[nazev_orig] => Four legged robot walking gait generation
[duvernost_udaju_id] => S
[popis] => This contribution is focused on the walking gait generation for a four legged robot using state space search algorithms and extends previous work, mainly (Ondroušek, 2006, 2007). A-star algorithm and beam search algorithm were implemented and verified by means of software simulation in 2006. Following goals were set for 2007: improvement of walking gait generation by using branch-and-bound algorithm and perfoming real tests on the four-legged walking robot with two degrees of freedom for each leg.
[popis_orig] => This contribution is focused on the walking gait generation for a four legged robot using state space search algorithms and extends previous work, mainly (Ondroušek, 2006, 2007). A-star algorithm and beam search algorithm were implemented and verified by means of software simulation in 2006. Following goals were set for 2007: improvement of walking gait generation by using branch-and-bound algorithm and perfoming real tests on the four-legged walking robot with two degrees of freedom for each leg.
[klicova_slova] => robot, walking gait, A-star, beam search
[klicova_slova_orig] => robot, walking gait, A-star, beam search
[url] =>
[oecd_obor_id] => 20204
[odpovedny_utvar_id] => 207
[odpovedny_utvar_nazev] => Institute of Automation and Computer Science
[odpovedny_utvar_zkratka] => IACS
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FME
[nadrazena_soucast_nazev] => Faculty of Mechanical Engineering
[originalni_jazyk] => en
[schvalil_id] => 999999
[schvaleno] => 2010-12-03
[vykazovat_riv] => 0
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => ONDROUŠEK, V.; VĚCHET, S.; KREJSA, J.; HOUŠKA, P.
[pocet_tvurcu] => 4
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] =>
[kod_dspace] =>
[rok_vytvoreni] =>
[pocet_zaznamu] =>
[zverejneno] => 1
[prvni_autor] =>
[korespondencni_autor] =>
[posledni_autor] =>
[znamka] =>
[kategorie_nazev] => Publication results
[druh_nazev] => Chapter in a book
[druh_popis] => Chapter in a book
[stav] => Approved
[vysledek_kategorie_id] => PV
[vysledek_system_kategorie_id] => PU
[vysledek_stav_id] => 3
[vlozil] => Informační systém Automat
[upravil] => Informační systém Automat
[ins_uid] => 999999
[upd_uid] => 999999
[ins_ts] => 2025-09-22
[upd_ts] => 2025-09-22
[status] => 9
[identifikator] => ISBN 978-80-214-3559-9
[identifikator_popis] => ISBN - Simulation Modelling of Mechatronic Systems III
[riv_dodavka_id] => 98
[riv_dodavka_oznaceni] => RIV10-MSM-26210___
[riv_dodavka_rok] => 2010
[diagnostika_pocet] => 0
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 0
[citace_text] => ONDROUŠEK, V.; VĚCHET, S.; KREJSA, J.; HOUŠKA, P. Four legged robot walking gait generation. In Simulation Modelling of Mechatronic Systems III. mechatronics. Brno: VUT v Brně, 2007. p. 123-129. ISBN: 978-80-214-3559-9.
[citace_html] => ONDROUŠEK, V.; VĚCHET, S.; KREJSA, J.; HOUŠKA, P. Four legged robot walking gait generation. In Simulation Modelling of Mechatronic Systems III. mechatronics. Brno: VUT v Brně, 2007. p. 123-129. ISBN: 978-80-214-3559-9.
[citace_rtf] =>
[citace_bibtex] => @inbook{BUT55427,
author="Vít {Ondroušek} and Stanislav {Věchet} and Jiří {Krejsa} and Pavel {Houška}",
title="Four legged robot walking gait generation",
booktitle="Simulation Modelling of Mechatronic Systems III",
year="2007",
publisher="VUT v Brně",
address="Brno",
series="mechatronics",
edition="1",
pages="123--129",
isbn="978-80-214-3559-9"
}
[vykazano] =>
[vykazano_aspon_jednou] =>
[identifikacni_kod] =>
[neautorsky_vysledek] => 0
[if] =>
[if_q] =>
[if_m17_q] =>
[if_m25_q] =>
[if_d] =>
[if_m17_d] =>
[if_m25_d] =>
[if_percentil] =>
[if_m17_percentil] =>
[if_m25_percentil] =>
[ais] =>
[ais_m17_q] =>
[ais_m25_q] =>
[ais_m17_d] =>
[ais_m25_d] =>
[ais_m17_percentil] =>
[ais_m25_percentil] =>
[jci] =>
[jci_q] =>
[jci_percentil] =>
[ef] =>
[scopus_sjr] =>
[scopus_sjr_q] =>
[scopus_sjr_d] =>
[nature_index_group] =>
[incites_times_cited] =>
[incites_open_access] =>
[incites_jnci] =>
[incites_is_int_collab] =>
[incites_is_industry_collab] =>
[incites_esi_hot_paper] =>
[incites_esi_highly_cited_paper] =>
[incites_avg_cnci] =>
[incites_avg_percentile] =>
[scival_citations_count] =>
[scival_fwci] =>
[core_rank] => NA
[oecd_tree_oblast_id] => 20000
[oecd_tree_oblast_nazev] => 2. Engineering and Technology
[oecd_tree_obor_id] => 20200
[oecd_tree_obor_nazev] => 2.2 Electrical engineering, Electronic engineering, Information engineering
[oecd_tree_podobor_id] => 20204
[oecd_tree_podobor_nazev] => Robotics and automatic control
[poznamka_metriky] =>
[nazev_en] => Four legged robot walking gait generation
[popis_en] => This contribution is focused on the walking gait generation for a four legged robot using state space search algorithms and extends previous work, mainly (Ondroušek, 2006, 2007). A-star algorithm and beam search algorithm were implemented and verified by means of software simulation in 2006. Following goals were set for 2007: improvement of walking gait generation by using branch-and-bound algorithm and perfoming real tests on the four-legged walking robot with two degrees of freedom for each leg.
[klicova_slova_en] => robot, walking gait, A-star, beam search
[vysledek_datum] => 2007-12-15T00:00:00+01:00
)
[3] => Array
(
[vysledek_id] => 55432
[vysledek_druh_id] => CHAPT
[ex_vysledek_id] => 71534
[vysledek_rok] => 2007
[nazev] => An Improved Insertion Heuristic for the Euclidean Minimum Steiner Tree Problem
[nazev_orig] => An Improved Insertion Heuristic for the Euclidean Minimum Steiner Tree Problem
[duvernost_udaju_id] => S
[popis] => The Euclidean Steiner Tree Problem is to find a shortest network spanning a set of fixed points in the plane, allowing the addition of auxiliary points to the set. The problem being NP-hard, polynomial-time approximations or heuristics are required. There are many rather complex heuristics based, e.g., on enumerating full topologies and consuming long time for computations for large instances. In this paper, we applied to use tools of computational geometry, especially the properties of Delaunay triangulation, a well-known geometric structure, and combine them with insertion heuristics based on the construction of the Euclidean minimum spanning tree. Thus an algorithm could be proposed that is very efficient and fast. Experiments confirmed that computations by this algorithm generate very good results in a reasonable amount of time, even for large instances of the studied problem.
[popis_orig] => The Euclidean Steiner Tree Problem is to find a shortest network spanning a set of fixed points in the plane, allowing the addition of auxiliary points to the set. The problem being NP-hard, polynomial-time approximations or heuristics are required. There are many rather complex heuristics based, e.g., on enumerating full topologies and consuming long time for computations for large instances. In this paper, we applied to use tools of computational geometry, especially the properties of Delaunay triangulation, a well-known geometric structure, and combine them with insertion heuristics based on the construction of the Euclidean minimum spanning tree. Thus an algorithm could be proposed that is very efficient and fast. Experiments confirmed that computations by this algorithm generate very good results in a reasonable amount of time, even for large instances of the studied problem.
[klicova_slova] => Steiner tree, spanning tree, Delaunay triangulation, time complexity, NP-hard problems
[klicova_slova_orig] => Steiner tree, spanning tree, Delaunay triangulation, time complexity, NP-hard problems
[url] =>
[oecd_obor_id] => 10103
[odpovedny_utvar_id] => 207
[odpovedny_utvar_nazev] => Institute of Automation and Computer Science
[odpovedny_utvar_zkratka] => IACS
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FME
[nadrazena_soucast_nazev] => Faculty of Mechanical Engineering
[originalni_jazyk] => en
[schvalil_id] => 999999
[schvaleno] => 2010-12-03
[vykazovat_riv] => 0
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => ŠEDA, M.
[pocet_tvurcu] => 1
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] =>
[kod_dspace] =>
[rok_vytvoreni] =>
[pocet_zaznamu] =>
[zverejneno] => 1
[prvni_autor] =>
[korespondencni_autor] =>
[posledni_autor] =>
[znamka] =>
[kategorie_nazev] => Publication results
[druh_nazev] => Chapter in a book
[druh_popis] => Chapter in a book
[stav] => Approved
[vysledek_kategorie_id] => PV
[vysledek_system_kategorie_id] => PU
[vysledek_stav_id] => 3
[vlozil] => Informační systém Automat
[upravil] => Informační systém Automat
[ins_uid] => 999999
[upd_uid] => 999999
[ins_ts] => 2025-09-22
[upd_ts] => 2025-09-22
[status] => 9
[identifikator] => ISBN 3-901509-60-7
[identifikator_popis] => ISBN - Katalinic, B. (ed.): DAAAM International Scientific Book 2007
[riv_dodavka_id] => 98
[riv_dodavka_oznaceni] => RIV10-MSM-26210___
[riv_dodavka_rok] => 2010
[diagnostika_pocet] => 0
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 0
[citace_text] => ŠEDA, M. An Improved Insertion Heuristic for the Euclidean Minimum Steiner Tree Problem. In Katalinic, B. (ed.): DAAAM International Scientific Book 2007. DAAAM International Scientific Book. Wien (Austria): DAAAM International, 2007. p. 501-512. ISBN: 3-901509-60-7.
[citace_html] => ŠEDA, M. An Improved Insertion Heuristic for the Euclidean Minimum Steiner Tree Problem. In Katalinic, B. (ed.): DAAAM International Scientific Book 2007. DAAAM International Scientific Book. Wien (Austria): DAAAM International, 2007. p. 501-512. ISBN: 3-901509-60-7.
[citace_rtf] =>
[citace_bibtex] => @inbook{BUT55432,
author="Miloš {Šeda}",
title="An Improved Insertion Heuristic for the Euclidean Minimum Steiner Tree Problem",
booktitle="Katalinic, B. (ed.): DAAAM International Scientific Book 2007",
year="2007",
publisher="DAAAM International",
address="Wien (Austria)",
series="DAAAM International Scientific Book",
edition="1",
pages="501--512",
isbn="3-901509-60-7"
}
[vykazano] =>
[vykazano_aspon_jednou] =>
[identifikacni_kod] =>
[neautorsky_vysledek] => 0
[if] =>
[if_q] =>
[if_m17_q] =>
[if_m25_q] =>
[if_d] =>
[if_m17_d] =>
[if_m25_d] =>
[if_percentil] =>
[if_m17_percentil] =>
[if_m25_percentil] =>
[ais] =>
[ais_m17_q] =>
[ais_m25_q] =>
[ais_m17_d] =>
[ais_m25_d] =>
[ais_m17_percentil] =>
[ais_m25_percentil] =>
[jci] =>
[jci_q] =>
[jci_percentil] =>
[ef] =>
[scopus_sjr] =>
[scopus_sjr_q] =>
[scopus_sjr_d] =>
[nature_index_group] =>
[incites_times_cited] =>
[incites_open_access] =>
[incites_jnci] =>
[incites_is_int_collab] =>
[incites_is_industry_collab] =>
[incites_esi_hot_paper] =>
[incites_esi_highly_cited_paper] =>
[incites_avg_cnci] =>
[incites_avg_percentile] =>
[scival_citations_count] =>
[scival_fwci] =>
[core_rank] => NA
[oecd_tree_oblast_id] => 10000
[oecd_tree_oblast_nazev] => 1. Natural Sciences
[oecd_tree_obor_id] => 10100
[oecd_tree_obor_nazev] => 1.1 Mathematics
[oecd_tree_podobor_id] => 10103
[oecd_tree_podobor_nazev] => Statistics and probability
[poznamka_metriky] =>
[nazev_en] => An Improved Insertion Heuristic for the Euclidean Minimum Steiner Tree Problem
[popis_en] => The Euclidean Steiner Tree Problem is to find a shortest network spanning a set of fixed points in the plane, allowing the addition of auxiliary points to the set. The problem being NP-hard, polynomial-time approximations or heuristics are required. There are many rather complex heuristics based, e.g., on enumerating full topologies and consuming long time for computations for large instances. In this paper, we applied to use tools of computational geometry, especially the properties of Delaunay triangulation, a well-known geometric structure, and combine them with insertion heuristics based on the construction of the Euclidean minimum spanning tree. Thus an algorithm could be proposed that is very efficient and fast. Experiments confirmed that computations by this algorithm generate very good results in a reasonable amount of time, even for large instances of the studied problem.
[klicova_slova_en] => Steiner tree, spanning tree, Delaunay triangulation, time complexity, NP-hard problems
[vysledek_datum] => 2007-12-31T00:00:00+01:00
)
[4] => Array
(
[vysledek_id] => 55433
[vysledek_druh_id] => CHAPT
[ex_vysledek_id] => 71538
[vysledek_rok] => 2007
[nazev] => Real-Time Robot Motion Planning Based on the Generalised Voronoi Diagram
[nazev_orig] => Real-Time Robot Motion Planning Based on the Generalised Voronoi Diagram
[duvernost_udaju_id] => S
[popis] => Real-time motion planning of an autonomous robot in an unknown or partially known indoor or outdoor environment is a difficult task, especially when the generated path must preserve the safest distance from surrounding obstacles and the robot's kinodynamics properties, its localisation, and uncertainty of the environment are also considered. A novel approximation geometric algorithm for computing the generalised Voronoi diagram based on the Fortune plane sweep technique is proposed, which presents a trade-off between the efficiency of computation, implementation difficulty, and robustness. This algorithm is further utilised in a new real-time motion planning technique.
[popis_orig] => Real-time motion planning of an autonomous robot in an unknown or partially known indoor or outdoor environment is a difficult task, especially when the generated path must preserve the safest distance from surrounding obstacles and the robot's kinodynamics properties, its localisation, and uncertainty of the environment are also considered. A novel approximation geometric algorithm for computing the generalised Voronoi diagram based on the Fortune plane sweep technique is proposed, which presents a trade-off between the efficiency of computation, implementation difficulty, and robustness. This algorithm is further utilised in a new real-time motion planning technique.
[klicova_slova] => robot motion planning, Voronoi diagram, plane sweep algorithm, real-time
[klicova_slova_orig] => robot motion planning, Voronoi diagram, plane sweep algorithm, real-time
[url] =>
[oecd_obor_id] => 20204
[odpovedny_utvar_id] => 207
[odpovedny_utvar_nazev] => Institute of Automation and Computer Science
[odpovedny_utvar_zkratka] => IACS
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FME
[nadrazena_soucast_nazev] => Faculty of Mechanical Engineering
[originalni_jazyk] => en
[schvalil_id] => 999999
[schvaleno] => 2010-12-03
[vykazovat_riv] => 0
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => ŠVEC, P.
[pocet_tvurcu] => 1
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] =>
[kod_dspace] =>
[rok_vytvoreni] =>
[pocet_zaznamu] =>
[zverejneno] => 1
[prvni_autor] =>
[korespondencni_autor] =>
[posledni_autor] =>
[znamka] =>
[kategorie_nazev] => Publication results
[druh_nazev] => Chapter in a book
[druh_popis] => Chapter in a book
[stav] => Approved
[vysledek_kategorie_id] => PV
[vysledek_system_kategorie_id] => PU
[vysledek_stav_id] => 3
[vlozil] => Informační systém Automat
[upravil] => Informační systém Automat
[ins_uid] => 999999
[upd_uid] => 999999
[ins_ts] => 2025-09-22
[upd_ts] => 2025-09-22
[status] => 9
[identifikator] => ISBN 978-80-214-3559-9
[identifikator_popis] => ISBN - Simulation Modelling of Mechatronic Systems III
[riv_dodavka_id] => 98
[riv_dodavka_oznaceni] => RIV10-MSM-26210___
[riv_dodavka_rok] => 2010
[diagnostika_pocet] => 0
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 0
[citace_text] => ŠVEC, P. Real-Time Robot Motion Planning Based on the Generalised Voronoi Diagram. In Simulation Modelling of Mechatronic Systems III. Mechatronika. Brno: Brno University of Technology, Faculty of Mechanical Engineering, 2007. p. 121-131. ISBN: 978-80-214-3559-9.
[citace_html] => ŠVEC, P. Real-Time Robot Motion Planning Based on the Generalised Voronoi Diagram. In Simulation Modelling of Mechatronic Systems III. Mechatronika. Brno: Brno University of Technology, Faculty of Mechanical Engineering, 2007. p. 121-131. ISBN: 978-80-214-3559-9.
[citace_rtf] =>
[citace_bibtex] => @inbook{BUT55433,
author="Petr {Švec}",
title="Real-Time Robot Motion Planning Based on the Generalised Voronoi Diagram",
booktitle="Simulation Modelling of Mechatronic Systems III",
year="2007",
publisher="Brno University of Technology, Faculty of Mechanical Engineering",
address="Brno",
series="Mechatronika",
edition="3",
pages="121--131",
isbn="978-80-214-3559-9"
}
[vykazano] =>
[vykazano_aspon_jednou] =>
[identifikacni_kod] =>
[neautorsky_vysledek] => 0
[if] =>
[if_q] =>
[if_m17_q] =>
[if_m25_q] =>
[if_d] =>
[if_m17_d] =>
[if_m25_d] =>
[if_percentil] =>
[if_m17_percentil] =>
[if_m25_percentil] =>
[ais] =>
[ais_m17_q] =>
[ais_m25_q] =>
[ais_m17_d] =>
[ais_m25_d] =>
[ais_m17_percentil] =>
[ais_m25_percentil] =>
[jci] =>
[jci_q] =>
[jci_percentil] =>
[ef] =>
[scopus_sjr] =>
[scopus_sjr_q] =>
[scopus_sjr_d] =>
[nature_index_group] =>
[incites_times_cited] =>
[incites_open_access] =>
[incites_jnci] =>
[incites_is_int_collab] =>
[incites_is_industry_collab] =>
[incites_esi_hot_paper] =>
[incites_esi_highly_cited_paper] =>
[incites_avg_cnci] =>
[incites_avg_percentile] =>
[scival_citations_count] =>
[scival_fwci] =>
[core_rank] => NA
[oecd_tree_oblast_id] => 20000
[oecd_tree_oblast_nazev] => 2. Engineering and Technology
[oecd_tree_obor_id] => 20200
[oecd_tree_obor_nazev] => 2.2 Electrical engineering, Electronic engineering, Information engineering
[oecd_tree_podobor_id] => 20204
[oecd_tree_podobor_nazev] => Robotics and automatic control
[poznamka_metriky] =>
[nazev_en] => Real-Time Robot Motion Planning Based on the Generalised Voronoi Diagram
[popis_en] => Real-time motion planning of an autonomous robot in an unknown or partially known indoor or outdoor environment is a difficult task, especially when the generated path must preserve the safest distance from surrounding obstacles and the robot's kinodynamics properties, its localisation, and uncertainty of the environment are also considered. A novel approximation geometric algorithm for computing the generalised Voronoi diagram based on the Fortune plane sweep technique is proposed, which presents a trade-off between the efficiency of computation, implementation difficulty, and robustness. This algorithm is further utilised in a new real-time motion planning technique.
[klicova_slova_en] => robot motion planning, Voronoi diagram, plane sweep algorithm, real-time
[vysledek_datum] => 2007-12-31T00:00:00+01:00
)
[5] => Array
(
[vysledek_id] => 55437
[vysledek_druh_id] => CHAPT
[ex_vysledek_id] => 72309
[vysledek_rok] => 2007
[nazev] => Application of Fuzzy Logic to Automatic Control
[nazev_orig] => Application of Fuzzy Logic to Automatic Control
[duvernost_udaju_id] => S
[popis] => This chapter deals with an application of fuzzy logic in control. It defines the concepts of the fuzzy set theory necessary for setting and aggregating the rules of a knowledge base. It shows that fuzzy control can be applied if the mathematical description of the system under control is not available or if the system is strongly nonlinear and hardly controllable by the classical methods.
[popis_orig] => This chapter deals with an application of fuzzy logic in control. It defines the concepts of the fuzzy set theory necessary for setting and aggregating the rules of a knowledge base. It shows that fuzzy control can be applied if the mathematical description of the system under control is not available or if the system is strongly nonlinear and hardly controllable by the classical methods.
[klicova_slova] => fuzzy controller, fuzzification, rule base, inference, defuzzification
[klicova_slova_orig] => fuzzy controller, fuzzification, rule base, inference, defuzzification
[url] =>
[oecd_obor_id] => 10201
[odpovedny_utvar_id] => 207
[odpovedny_utvar_nazev] => Institute of Automation and Computer Science
[odpovedny_utvar_zkratka] => IACS
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FME
[nadrazena_soucast_nazev] => Faculty of Mechanical Engineering
[originalni_jazyk] => en
[schvalil_id] => 999999
[schvaleno] => 2010-12-03
[vykazovat_riv] => 0
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => ŠEDA, M.
[pocet_tvurcu] => 1
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] =>
[kod_dspace] =>
[rok_vytvoreni] =>
[pocet_zaznamu] =>
[zverejneno] => 1
[prvni_autor] =>
[korespondencni_autor] =>
[posledni_autor] =>
[znamka] =>
[kategorie_nazev] => Publication results
[druh_nazev] => Chapter in a book
[druh_popis] => Chapter in a book
[stav] => Approved
[vysledek_kategorie_id] => PV
[vysledek_system_kategorie_id] => PU
[vysledek_stav_id] => 3
[vlozil] => Informační systém Automat
[upravil] => Informační systém Automat
[ins_uid] => 999999
[upd_uid] => 999999
[ins_ts] => 2025-09-22
[upd_ts] => 2025-09-22
[status] => 9
[identifikator] => ISBN 978-80-214-3559-9
[identifikator_popis] => ISBN - Březina, T. (ed.): Simulation Modelling of Mechatronics Systems III.
[riv_dodavka_id] => 98
[riv_dodavka_oznaceni] => RIV10-MSM-26210___
[riv_dodavka_rok] => 2010
[diagnostika_pocet] => 0
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 0
[citace_text] => ŠEDA, M. Application of Fuzzy Logic to Automatic Control. In Březina, T. (ed.): Simulation Modelling of Mechatronics Systems III. Mechatronika. Brno: Brno University of Technology, FME, 2007. p. 15-26. ISBN: 978-80-214-3559-9.
[citace_html] => ŠEDA, M. Application of Fuzzy Logic to Automatic Control. In Březina, T. (ed.): Simulation Modelling of Mechatronics Systems III. Mechatronika. Brno: Brno University of Technology, FME, 2007. p. 15-26. ISBN: 978-80-214-3559-9.
[citace_rtf] =>
[citace_bibtex] => @inbook{BUT55437,
author="Miloš {Šeda}",
title="Application of Fuzzy Logic to Automatic Control",
booktitle="Březina, T. (ed.): Simulation Modelling of Mechatronics Systems III.",
year="2007",
publisher="Brno University of Technology, FME",
address="Brno",
series="Mechatronika",
edition="1",
pages="15--26",
isbn="978-80-214-3559-9"
}
[vykazano] =>
[vykazano_aspon_jednou] =>
[identifikacni_kod] =>
[neautorsky_vysledek] => 0
[if] =>
[if_q] =>
[if_m17_q] =>
[if_m25_q] =>
[if_d] =>
[if_m17_d] =>
[if_m25_d] =>
[if_percentil] =>
[if_m17_percentil] =>
[if_m25_percentil] =>
[ais] =>
[ais_m17_q] =>
[ais_m25_q] =>
[ais_m17_d] =>
[ais_m25_d] =>
[ais_m17_percentil] =>
[ais_m25_percentil] =>
[jci] =>
[jci_q] =>
[jci_percentil] =>
[ef] =>
[scopus_sjr] =>
[scopus_sjr_q] =>
[scopus_sjr_d] =>
[nature_index_group] =>
[incites_times_cited] =>
[incites_open_access] =>
[incites_jnci] =>
[incites_is_int_collab] =>
[incites_is_industry_collab] =>
[incites_esi_hot_paper] =>
[incites_esi_highly_cited_paper] =>
[incites_avg_cnci] =>
[incites_avg_percentile] =>
[scival_citations_count] =>
[scival_fwci] =>
[core_rank] => NA
[oecd_tree_oblast_id] => 10000
[oecd_tree_oblast_nazev] => 1. Natural Sciences
[oecd_tree_obor_id] => 10200
[oecd_tree_obor_nazev] => 1.2 Computer and information sciences
[oecd_tree_podobor_id] => 10201
[oecd_tree_podobor_nazev] => Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
[poznamka_metriky] =>
[nazev_en] => Application of Fuzzy Logic to Automatic Control
[popis_en] => This chapter deals with an application of fuzzy logic in control. It defines the concepts of the fuzzy set theory necessary for setting and aggregating the rules of a knowledge base. It shows that fuzzy control can be applied if the mathematical description of the system under control is not available or if the system is strongly nonlinear and hardly controllable by the classical methods.
[klicova_slova_en] => fuzzy controller, fuzzification, rule base, inference, defuzzification
[vysledek_datum] => 2007-12-31T00:00:00+01:00
)
[6] => Array
(
[vysledek_id] => 55521
[vysledek_druh_id] => CHAPT
[ex_vysledek_id] => 46995
[vysledek_rok] => 2004
[nazev] => Solving the Integer Maximal Multicommodity Flow Problem Using Simulated Annealing
[nazev_orig] => Solving the Integer Maximal Multicommodity Flow Problem Using Simulated Annealing
[duvernost_udaju_id] => S
[popis] => In this paper the Integer Maximal Multicommodity Flow Problem is discussed. Multicommodity flow problems have many specific formulations depending on the constraints defined resulting in various applications in transportation, distribution and telecommunications. Since its integer version belongs to the class of NP-hard combinatorial problems, for large scale instances, it must be solved by approximation or heuristic techniques. We present a stochastic heuristic approach based on a simulated annealing algorithm. All evaluations of the objective function in this algorithm are provided by an allocation procedure. Since the allocation of the edge capacities among the commodities and the corresponding combined maximal flow depend on the order in which the commodities are selected, the neighbouring mechanism in simulated annealing is set to generate permutations of commodities. Computational results show that, for suitable parameter settings presented in the paper, this approach is able to find the optimal solution almost in all cases or at least a solution very close to optimum when the test is executed several times. Furthermore, the proposed algorithm is stable because even the average results gained from all the executions are close to optimum.
[popis_orig] => In this paper the Integer Maximal Multicommodity Flow Problem is discussed. Multicommodity flow problems have many specific formulations depending on the constraints defined resulting in various applications in transportation, distribution and telecommunications. Since its integer version belongs to the class of NP-hard combinatorial problems, for large scale instances, it must be solved by approximation or heuristic techniques. We present a stochastic heuristic approach based on a simulated annealing algorithm. All evaluations of the objective function in this algorithm are provided by an allocation procedure. Since the allocation of the edge capacities among the commodities and the corresponding combined maximal flow depend on the order in which the commodities are selected, the neighbouring mechanism in simulated annealing is set to generate permutations of commodities. Computational results show that, for suitable parameter settings presented in the paper, this approach is able to find the optimal solution almost in all cases or at least a solution very close to optimum when the test is executed several times. Furthermore, the proposed algorithm is stable because even the average results gained from all the executions are close to optimum.
[klicova_slova] =>
[klicova_slova_orig] =>
[url] =>
[oecd_obor_id] => 10103
[odpovedny_utvar_id] => 207
[odpovedny_utvar_nazev] => Institute of Automation and Computer Science
[odpovedny_utvar_zkratka] => IACS
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FME
[nadrazena_soucast_nazev] => Faculty of Mechanical Engineering
[originalni_jazyk] => en
[schvalil_id] => 999999
[schvaleno] => 2016-04-15
[vykazovat_riv] => 0
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => ŠEDA, M.
[pocet_tvurcu] => 1
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] =>
[kod_dspace] =>
[rok_vytvoreni] =>
[pocet_zaznamu] =>
[zverejneno] => 1
[prvni_autor] =>
[korespondencni_autor] =>
[posledni_autor] =>
[znamka] =>
[kategorie_nazev] => Publication results
[druh_nazev] => Chapter in a book
[druh_popis] => Chapter in a book
[stav] => Approved
[vysledek_kategorie_id] => PV
[vysledek_system_kategorie_id] => PU
[vysledek_stav_id] => 3
[vlozil] => Informační systém Automat
[upravil] => Informační systém Automat
[ins_uid] => 999999
[upd_uid] => 999999
[ins_ts] => 2025-09-22
[upd_ts] => 2025-09-22
[status] => 9
[identifikator] => ISBN 3-901509-38-0 ISSN 1726-9687
[identifikator_popis] => ISBN - Katalinic, B. (ed.): DAAAM International Scientific Book 2004 ISSN - DAAAM International Scientific Book (AT)
[riv_dodavka_id] =>
[riv_dodavka_oznaceni] =>
[riv_dodavka_rok] =>
[diagnostika_pocet] => 0
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 0
[citace_text] => ŠEDA, M. Solving the Integer Maximal Multicommodity Flow Problem Using Simulated Annealing. In Katalinic, B. (ed.): DAAAM International Scientific Book 2004. DAAAM International Scientific Book. DAAAM International Scientific Book 2004. Wien: DAAAM International Wien, 2004. 10 p. ISBN: 3-901509-38-0. ISSN: 1726-9687.
[citace_html] => ŠEDA, M. Solving the Integer Maximal Multicommodity Flow Problem Using Simulated Annealing. In Katalinic, B. (ed.): DAAAM International Scientific Book 2004. DAAAM International Scientific Book. DAAAM International Scientific Book 2004. Wien: DAAAM International Wien, 2004. 10 p. ISBN: 3-901509-38-0. ISSN: 1726-9687.
[citace_rtf] =>
[citace_bibtex] => @inbook{BUT55521,
author="Miloš {Šeda}",
title="Solving the Integer Maximal Multicommodity Flow Problem Using Simulated Annealing",
booktitle="Katalinic, B. (ed.): DAAAM International Scientific Book 2004",
year="2004",
publisher="DAAAM International Wien",
address="Wien",
series="DAAAM International Scientific Book 2004",
pages="10",
isbn="3-901509-38-0"
}
[vykazano] =>
[vykazano_aspon_jednou] =>
[identifikacni_kod] =>
[neautorsky_vysledek] => 0
[if] =>
[if_q] =>
[if_m17_q] =>
[if_m25_q] =>
[if_d] =>
[if_m17_d] =>
[if_m25_d] =>
[if_percentil] =>
[if_m17_percentil] =>
[if_m25_percentil] =>
[ais] =>
[ais_m17_q] =>
[ais_m25_q] =>
[ais_m17_d] =>
[ais_m25_d] =>
[ais_m17_percentil] =>
[ais_m25_percentil] =>
[jci] =>
[jci_q] =>
[jci_percentil] =>
[ef] =>
[scopus_sjr] =>
[scopus_sjr_q] =>
[scopus_sjr_d] =>
[nature_index_group] =>
[incites_times_cited] =>
[incites_open_access] =>
[incites_jnci] =>
[incites_is_int_collab] =>
[incites_is_industry_collab] =>
[incites_esi_hot_paper] =>
[incites_esi_highly_cited_paper] =>
[incites_avg_cnci] =>
[incites_avg_percentile] =>
[scival_citations_count] =>
[scival_fwci] =>
[core_rank] => NA
[oecd_tree_oblast_id] => 10000
[oecd_tree_oblast_nazev] => 1. Natural Sciences
[oecd_tree_obor_id] => 10100
[oecd_tree_obor_nazev] => 1.1 Mathematics
[oecd_tree_podobor_id] => 10103
[oecd_tree_podobor_nazev] => Statistics and probability
[poznamka_metriky] =>
[nazev_en] => Solving the Integer Maximal Multicommodity Flow Problem Using Simulated Annealing
[popis_en] => In this paper the Integer Maximal Multicommodity Flow Problem is discussed. Multicommodity flow problems have many specific formulations depending on the constraints defined resulting in various applications in transportation, distribution and telecommunications. Since its integer version belongs to the class of NP-hard combinatorial problems, for large scale instances, it must be solved by approximation or heuristic techniques. We present a stochastic heuristic approach based on a simulated annealing algorithm. All evaluations of the objective function in this algorithm are provided by an allocation procedure. Since the allocation of the edge capacities among the commodities and the corresponding combined maximal flow depend on the order in which the commodities are selected, the neighbouring mechanism in simulated annealing is set to generate permutations of commodities. Computational results show that, for suitable parameter settings presented in the paper, this approach is able to find the optimal solution almost in all cases or at least a solution very close to optimum when the test is executed several times. Furthermore, the proposed algorithm is stable because even the average results gained from all the executions are close to optimum.
[klicova_slova_en] => Multicommodity network flow, integer programming, NP-hard problems, stochastic heuristics, simulated annealing, neighbourhood operation
[vysledek_datum] => 2004-10-01T00:00:00+02:00
)
[7] => Array
(
[vysledek_id] => 55559
[vysledek_druh_id] => CHAPT
[ex_vysledek_id] => 74154
[vysledek_rok] => 2007
[nazev] => Device for Experimental Modelling of Biomechanical Systems Properties
[nazev_orig] => Device for Experimental Modelling of Biomechanical Systems Properties
[duvernost_udaju_id] => S
[popis] => The chapter presents one of control design possibilities for the cord implants testing device. The device was designed in such a way that its movements are as close as possible to the real physiological movements. General motion and effector action forces are simulated by parallel mechanism called Stewart platform (hexapod). Typically the hexapod structure has six linearly actuated legs, these are connected to the base plate and the top (mobile) plate by universal joints located at both of ends of the each leg. The six DOF top plate position and orientation depend on the length of each leg.
[popis_orig] => The chapter presents one of control design possibilities for the cord implants testing device. The device was designed in such a way that its movements are as close as possible to the real physiological movements. General motion and effector action forces are simulated by parallel mechanism called Stewart platform (hexapod). Typically the hexapod structure has six linearly actuated legs, these are connected to the base plate and the top (mobile) plate by universal joints located at both of ends of the each leg. The six DOF top plate position and orientation depend on the length of each leg.
[klicova_slova] => biomechanics; mechatronics
[klicova_slova_orig] => biomechanics; mechatronics
[url] =>
[oecd_obor_id] => 20301
[odpovedny_utvar_id] => 207
[odpovedny_utvar_nazev] => Institute of Automation and Computer Science
[odpovedny_utvar_zkratka] => IACS
[nadrazena_soucast_id] => 4
[nadrazena_soucast_zkratka] => FME
[nadrazena_soucast_nazev] => Faculty of Mechanical Engineering
[originalni_jazyk] => en
[schvalil_id] => 999999
[schvaleno] => 2010-12-03
[vykazovat_riv] => 0
[vykazovat_riv_zmeny] => 1
[slozka_id] =>
[posledni_diagnostika] =>
[vycet_osob] => BŘEZINA, T.; HOUŠKA, P.; BŘEZINA, L.; ANDRŠ, O.
[pocet_tvurcu] => 4
[tvurci_ids] =>
[poznamka] =>
[typ_nazev] =>
[kod_doi] =>
[kod_dspace] =>
[rok_vytvoreni] =>
[pocet_zaznamu] =>
[zverejneno] => 1
[prvni_autor] =>
[korespondencni_autor] =>
[posledni_autor] =>
[znamka] =>
[kategorie_nazev] => Publication results
[druh_nazev] => Chapter in a book
[druh_popis] => Chapter in a book
[stav] => Approved
[vysledek_kategorie_id] => PV
[vysledek_system_kategorie_id] => PU
[vysledek_stav_id] => 3
[vlozil] => Informační systém Automat
[upravil] => Informační systém Automat
[ins_uid] => 999999
[upd_uid] => 999999
[ins_ts] => 2025-09-22
[upd_ts] => 2025-09-22
[status] => 9
[identifikator] => ISBN 978-80-214-3559-9
[identifikator_popis] => ISBN - Simulation Modelling of Mechatronic Systems III
[riv_dodavka_id] => 98
[riv_dodavka_oznaceni] => RIV10-MSM-26210___
[riv_dodavka_rok] => 2010
[diagnostika_pocet] => 0
[diagnostika_pocet_chyba] => 0
[diagnostika_pocet_upozorneni] => 0
[diagnostika_pocet_informace] => 0
[citace_text] => BŘEZINA, T.; HOUŠKA, P.; BŘEZINA, L.; ANDRŠ, O. Device for Experimental Modelling of Biomechanical Systems Properties. In Simulation Modelling of Mechatronic Systems III. mechatronika. Brno: VUT v Brně, 2007. p. 229-240. ISBN: 978-80-214-3559-9.
[citace_html] => BŘEZINA, T.; HOUŠKA, P.; BŘEZINA, L.; ANDRŠ, O. Device for Experimental Modelling of Biomechanical Systems Properties. In Simulation Modelling of Mechatronic Systems III. mechatronika. Brno: VUT v Brně, 2007. p. 229-240. ISBN: 978-80-214-3559-9.
[citace_rtf] =>
[citace_bibtex] => @inbook{BUT55559,
author="Tomáš {Březina} and Pavel {Houška} and Lukáš {Březina} and Ondřej {Andrš}",
title="Device for Experimental Modelling of Biomechanical Systems Properties",
booktitle="Simulation Modelling of Mechatronic Systems III",
year="2007",
publisher="VUT v Brně",
address="Brno",
series="mechatronika",
edition="1",
pages="229--240",
isbn="978-80-214-3559-9"
}
[vykazano] =>
[vykazano_aspon_jednou] =>
[identifikacni_kod] =>
[neautorsky_vysledek] => 0
[if] =>
[if_q] =>
[if_m17_q] =>
[if_m25_q] =>
[if_d] =>
[if_m17_d] =>
[if_m25_d] =>
[if_percentil] =>
[if_m17_percentil] =>
[if_m25_percentil] =>
[ais] =>
[ais_m17_q] =>
[ais_m25_q] =>
[ais_m17_d] =>
[ais_m25_d] =>
[ais_m17_percentil] =>
[ais_m25_percentil] =>
[jci] =>
[jci_q] =>
[jci_percentil] =>
[ef] =>
[scopus_sjr] =>
[scopus_sjr_q] =>
[scopus_sjr_d] =>
[nature_index_group] =>
[incites_times_cited] =>
[incites_open_access] =>
[incites_jnci] =>
[incites_is_int_collab] =>
[incites_is_industry_collab] =>
[incites_esi_hot_paper] =>
[incites_esi_highly_cited_paper] =>
[incites_avg_cnci] =>
[incites_avg_percentile] =>
[scival_citations_count] =>
[scival_fwci] =>
[core_rank] => NA
[oecd_tree_oblast_id] => 20000
[oecd_tree_oblast_nazev] => 2. Engineering and Technology
[oecd_tree_obor_id] => 20300
[oecd_tree_obor_nazev] => 2.3 Mechanical engineering
[oecd_tree_podobor_id] => 20301
[oecd_tree_podobor_nazev] => Mechanical engineering
[poznamka_metriky] =>
[nazev_en] => Device for Experimental Modelling of Biomechanical Systems Properties
[popis_en] => The chapter presents one of control design possibilities for the cord implants testing device. The device was designed in such a way that its movements are as close as possible to the real physiological movements. General motion and effector action forces are simulated by parallel mechanism called Stewart platform (hexapod). Typically the hexapod structure has six linearly actuated legs, these are connected to the base plate and the top (mobile) plate by universal joints located at both of ends of the each leg. The six DOF top plate position and orientation depend on the length of each leg.
[klicova_slova_en] => biomechanics; mechatronics
[vysledek_datum] => 2007-12-15T00:00:00+01:00
)
)
)
Array
(
[total] => 2086
[page] => 87
[count] => 8
[n_pages] => 140
[pagelen] => 15
[odkaz] => typVysledku=&rok=&ftext=&btnSubmit=1
[base_detail] => /en/veda/publikace/detail/
[base_page] => /en/veda/publikace
[vysledek] => Array
(
[0] => Array
(
[quotations] => BŘEZINA, T.; KRATOCHVÍL, C.; ONDRŮŠEK, Č.
[title] => Design Optimization of Mechatronic systems
[typ] => PV
[year] => 2007
[id_vav] => 55345
)
[1] => Array
(
[quotations] => ŠEDA, M.
[title] => Mixed Integer Programming vs. Genetic Algorithm Approach to Scheduling Permutation Flow Shop
[typ] => PV
[year] => 2005
[id_vav] => 55413
)
[2] => Array
(
[quotations] => ONDROUŠEK, V.; VĚCHET, S.; KREJSA, J.; HOUŠKA, P.
[title] => Four legged robot walking gait generation
[typ] => PV
[year] => 2007
[id_vav] => 55427
)
[3] => Array
(
[quotations] => ŠEDA, M.
[title] => An Improved Insertion Heuristic for the Euclidean Minimum Steiner Tree Problem
[typ] => PV
[year] => 2007
[id_vav] => 55432
)
[4] => Array
(
[quotations] => ŠVEC, P.
[title] => Real-Time Robot Motion Planning Based on the Generalised Voronoi Diagram
[typ] => PV
[year] => 2007
[id_vav] => 55433
)
[5] => Array
(
[quotations] => ŠEDA, M.
[title] => Application of Fuzzy Logic to Automatic Control
[typ] => PV
[year] => 2007
[id_vav] => 55437
)
[6] => Array
(
[quotations] => ŠEDA, M.
[title] => Solving the Integer Maximal Multicommodity Flow Problem Using Simulated Annealing
[typ] => PV
[year] => 2004
[id_vav] => 55521
)
[7] => Array
(
[quotations] => BŘEZINA, T.; HOUŠKA, P.; BŘEZINA, L.; ANDRŠ, O.
[title] => Device for Experimental Modelling of Biomechanical Systems Properties
[typ] => PV
[year] => 2007
[id_vav] => 55559
)
)
)