[{"publisher":"Springer","author":[{"last_name":"Li","first_name":"Shouwei","full_name":"Li, Shouwei"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"first_name":"Pavel","full_name":"Podlipyan, Pavel","last_name":"Podlipyan"}],"publication":"Algorithms for Sensor Systems, Proceedings of the 12th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS)","department":[{"_id":"63"}],"status":"public","date_created":"2020-04-01T12:28:09Z","user_id":"15415","title":"The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots","language":[{"iso":"eng"}],"citation":{"ieee":"S. Li, F. Meyer auf der Heide, and P. Podlipyan, “The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots,” in Algorithms for Sensor Systems, Proceedings of the 12th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS), 2016.","short":"S. Li, F. Meyer auf der Heide, P. Podlipyan, in: Algorithms for Sensor Systems, Proceedings of the 12th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS), Springer, 2016.","bibtex":"@inproceedings{Li_Meyer auf der Heide_Podlipyan_2016, title={The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots}, DOI={10.1007/978-3-319-53058-1_5 }, booktitle={Algorithms for Sensor Systems, Proceedings of the 12th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS)}, publisher={Springer}, author={Li, Shouwei and Meyer auf der Heide, Friedhelm and Podlipyan, Pavel}, year={2016} }","mla":"Li, Shouwei, et al. “The Impact of the Gabriel Subgraph of the Visibility Graph on the Gathering of Mobile Autonomous Robots.” Algorithms for Sensor Systems, Proceedings of the 12th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS), Springer, 2016, doi:10.1007/978-3-319-53058-1_5 .","chicago":"Li, Shouwei, Friedhelm Meyer auf der Heide, and Pavel Podlipyan. “The Impact of the Gabriel Subgraph of the Visibility Graph on the Gathering of Mobile Autonomous Robots.” In Algorithms for Sensor Systems, Proceedings of the 12th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS). Springer, 2016. https://doi.org/10.1007/978-3-319-53058-1_5 .","apa":"Li, S., Meyer auf der Heide, F., & Podlipyan, P. (2016). The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots. In Algorithms for Sensor Systems, Proceedings of the 12th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS). Springer. https://doi.org/10.1007/978-3-319-53058-1_5 ","ama":"Li S, Meyer auf der Heide F, Podlipyan P. The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots. In: Algorithms for Sensor Systems, Proceedings of the 12th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS). Springer; 2016. doi:10.1007/978-3-319-53058-1_5 "},"type":"conference","year":"2016","date_updated":"2022-01-06T06:52:49Z","_id":"16358","doi":"10.1007/978-3-319-53058-1_5 "},{"date_updated":"2022-01-06T06:52:49Z","_id":"16359","doi":"10.1145/2935764.2935789","page":"301-312","type":"conference","citation":{"ieee":"A. Cord-Landwehr, M. Fischer, D. Jung, and F. Meyer auf der Heide, “Asymptotically Optimal Gathering on a Grid,” in Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2016, pp. 301–312.","short":"A. Cord-Landwehr, M. Fischer, D. Jung, F. Meyer auf der Heide, in: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM, 2016, pp. 301–312.","mla":"Cord-Landwehr, Andreas, et al. “Asymptotically Optimal Gathering on a Grid.” Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM, 2016, pp. 301–12, doi:10.1145/2935764.2935789.","bibtex":"@inproceedings{Cord-Landwehr_Fischer_Jung_Meyer auf der Heide_2016, title={Asymptotically Optimal Gathering on a Grid}, DOI={10.1145/2935764.2935789}, booktitle={Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}, publisher={ACM}, author={Cord-Landwehr, Andreas and Fischer, Matthias and Jung, Daniel and Meyer auf der Heide, Friedhelm}, year={2016}, pages={301–312} }","chicago":"Cord-Landwehr, Andreas, Matthias Fischer, Daniel Jung, and Friedhelm Meyer auf der Heide. “Asymptotically Optimal Gathering on a Grid.” In Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 301–12. ACM, 2016. https://doi.org/10.1145/2935764.2935789.","ama":"Cord-Landwehr A, Fischer M, Jung D, Meyer auf der Heide F. Asymptotically Optimal Gathering on a Grid. In: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). ACM; 2016:301-312. doi:10.1145/2935764.2935789","apa":"Cord-Landwehr, A., Fischer, M., Jung, D., & Meyer auf der Heide, F. (2016). Asymptotically Optimal Gathering on a Grid. In Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) (pp. 301–312). ACM. https://doi.org/10.1145/2935764.2935789"},"year":"2016","language":[{"iso":"eng"}],"abstract":[{"text":"In this paper, we solve the local gathering problem of a swarm of n indistinguishable, point-shaped robots on a two dimensional grid in asymptotically optimal time O(n) in the fully synchronous FSYNC time model. Given an arbitrarily distributed (yet connected) swarm of robots, the gathering problem on the grid is to locate all robots within a 2x2- sized area that is not known beforehand. Two robots are connected if they are vertical or horizontal neighbors on the grid. The locality constraint means that no global control, no compass, no global communication and only local vision is available; hence, a robot can only see its grid neighbors up to a constant L1-distance, which also limits its movements. A robot can move to one of its eight neighboring grid cells and if two or more robots move to the same location they are merged to be only one robot. The locality constraint is the significant challenging issue here, since robot move- ments must not harm the (only globally checkable) swarm connectivity. For solving the gathering problem, we provide a synchronous algorithm { executed by every robot { which ensures that robots merge without breaking the swarm con- nectivity. In our model, robots can obtain a special state, which marks such a robot to be performing specific connec- tivity preserving movements in order to allow later merge operations of the swarm. Compared to the grid, for gath- ering in the Euclidean plane for the same robot and time model the best known upper bound is O(n^2).","lang":"eng"}],"title":"Asymptotically Optimal Gathering on a Grid","user_id":"15415","publication":"Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)","department":[{"_id":"63"}],"author":[{"last_name":"Cord-Landwehr","full_name":"Cord-Landwehr, Andreas","first_name":"Andreas"},{"last_name":"Fischer","id":"146","first_name":"Matthias","full_name":"Fischer, Matthias"},{"first_name":"Daniel","full_name":"Jung, Daniel","last_name":"Jung","id":"37827"},{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"publisher":"ACM","date_created":"2020-04-01T12:46:35Z","status":"public"},{"publisher":"IEEE","author":[{"first_name":"Sebastian","full_name":"Abshoff, Sebastian","last_name":"Abshoff"},{"first_name":"Andreas","full_name":"Cord-Landwehr, Andreas","last_name":"Cord-Landwehr"},{"last_name":"Fischer","id":"146","first_name":"Matthias","full_name":"Fischer, Matthias"},{"id":"37827","last_name":"Jung","full_name":"Jung, Daniel","first_name":"Daniel"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"publication":"Proceedings of the 30th International Parallel and Distributed Processing Symposium (IPDPS)","department":[{"_id":"63"}],"status":"public","date_created":"2020-04-01T12:56:43Z","abstract":[{"lang":"eng","text":"We consider the following variant of the two dimensional gathering problem for swarms of robots: Given a swarm of n indistinguishable, point shaped robots on a two dimensional grid. Initially, the robots form a closed chain on the grid and must keep this connectivity during the whole process of their gathering. Connectivity means, that neighboring robots of the chain need to be positioned at the same or neighboring points of the grid. In our model, gathering means to keep shortening the chain until the robots are located inside a 2*2 subgrid. Our model is completely local (no global control, no global coordinates, no compass, no global communication or vision, ...). Each robot can only see its next constant number of left and right neighbors on the chain. This fixed constant is called the viewing path length. All its operations and detections are restricted to this constant number of robots. Other robots, even if located at neighboring or the same grid point cannot be detected. Only based on the relative positions of its detectable chain neighbors, a robot can decide to obtain a certain state. Based on this state and their local knowledge, the robots do local modifications to the chain by moving to neighboring grid points without breaking the chain. These modifications are performed without the knowledge whether they lead to a global progress or not. We assume the fully synchronous FSYNC model. For this problem, we present a gathering algorithm which needs linear time. This result generalizes a result, where an open chain with specified distinguishable (and fixed) endpoints is considered. "}],"user_id":"15415","title":"Gathering a Closed Chain of Robots on a Grid","language":[{"iso":"eng"}],"citation":{"apa":"Abshoff, S., Cord-Landwehr, A., Fischer, M., Jung, D., & Meyer auf der Heide, F. (2016). Gathering a Closed Chain of Robots on a Grid. In Proceedings of the 30th International Parallel and Distributed Processing Symposium (IPDPS) (pp. 689–699). IEEE. https://doi.org/10.1109/IPDPS.2016.51","ama":"Abshoff S, Cord-Landwehr A, Fischer M, Jung D, Meyer auf der Heide F. Gathering a Closed Chain of Robots on a Grid. In: Proceedings of the 30th International Parallel and Distributed Processing Symposium (IPDPS). IEEE; 2016:689-699. doi:10.1109/IPDPS.2016.51","chicago":"Abshoff, Sebastian, Andreas Cord-Landwehr, Matthias Fischer, Daniel Jung, and Friedhelm Meyer auf der Heide. “Gathering a Closed Chain of Robots on a Grid.” In Proceedings of the 30th International Parallel and Distributed Processing Symposium (IPDPS), 689–99. IEEE, 2016. https://doi.org/10.1109/IPDPS.2016.51.","bibtex":"@inproceedings{Abshoff_Cord-Landwehr_Fischer_Jung_Meyer auf der Heide_2016, title={Gathering a Closed Chain of Robots on a Grid}, DOI={10.1109/IPDPS.2016.51}, booktitle={Proceedings of the 30th International Parallel and Distributed Processing Symposium (IPDPS)}, publisher={IEEE}, author={Abshoff, Sebastian and Cord-Landwehr, Andreas and Fischer, Matthias and Jung, Daniel and Meyer auf der Heide, Friedhelm}, year={2016}, pages={689–699} }","mla":"Abshoff, Sebastian, et al. “Gathering a Closed Chain of Robots on a Grid.” Proceedings of the 30th International Parallel and Distributed Processing Symposium (IPDPS), IEEE, 2016, pp. 689–99, doi:10.1109/IPDPS.2016.51.","short":"S. Abshoff, A. Cord-Landwehr, M. Fischer, D. Jung, F. Meyer auf der Heide, in: Proceedings of the 30th International Parallel and Distributed Processing Symposium (IPDPS), IEEE, 2016, pp. 689–699.","ieee":"S. Abshoff, A. Cord-Landwehr, M. Fischer, D. Jung, and F. Meyer auf der Heide, “Gathering a Closed Chain of Robots on a Grid,” in Proceedings of the 30th International Parallel and Distributed Processing Symposium (IPDPS), 2016, pp. 689–699."},"year":"2016","type":"conference","page":"689-699","date_updated":"2022-01-06T06:52:49Z","_id":"16360","doi":"10.1109/IPDPS.2016.51"},{"doi":"10.1109/ipdps.2016.91","date_updated":"2022-01-06T06:52:49Z","_id":"16364","language":[{"iso":"eng"}],"year":"2016","type":"conference","citation":{"ieee":"A. Macker, M. Malatyali, and F. Meyer auf der Heide, “On Competitive Algorithms for Approximations of Top-k-Position Monitoring of Distributed Streams,” in 2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2016.","short":"A. Macker, M. Malatyali, F. Meyer auf der Heide, in: 2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2016.","mla":"Macker, Alexander, et al. “On Competitive Algorithms for Approximations of Top-k-Position Monitoring of Distributed Streams.” 2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2016, doi:10.1109/ipdps.2016.91.","bibtex":"@inproceedings{Macker_Malatyali_Meyer auf der Heide_2016, title={On Competitive Algorithms for Approximations of Top-k-Position Monitoring of Distributed Streams}, DOI={10.1109/ipdps.2016.91}, booktitle={2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS)}, author={Macker, Alexander and Malatyali, Manuel and Meyer auf der Heide, Friedhelm}, year={2016} }","chicago":"Macker, Alexander, Manuel Malatyali, and Friedhelm Meyer auf der Heide. “On Competitive Algorithms for Approximations of Top-k-Position Monitoring of Distributed Streams.” In 2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2016. https://doi.org/10.1109/ipdps.2016.91.","apa":"Macker, A., Malatyali, M., & Meyer auf der Heide, F. (2016). On Competitive Algorithms for Approximations of Top-k-Position Monitoring of Distributed Streams. In 2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS). https://doi.org/10.1109/ipdps.2016.91","ama":"Macker A, Malatyali M, Meyer auf der Heide F. On Competitive Algorithms for Approximations of Top-k-Position Monitoring of Distributed Streams. In: 2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS). ; 2016. doi:10.1109/ipdps.2016.91"},"user_id":"15415","title":"On Competitive Algorithms for Approximations of Top-k-Position Monitoring of Distributed Streams","date_created":"2020-04-02T10:14:25Z","status":"public","publication_identifier":{"isbn":["9781509021406"]},"publication_status":"published","department":[{"_id":"63"}],"publication":"2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS)","author":[{"last_name":"Macker","first_name":"Alexander","full_name":"Macker, Alexander"},{"last_name":"Malatyali","full_name":"Malatyali, Manuel","first_name":"Manuel"},{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}]},{"user_id":"15415","title":"Cost-efficient Scheduling on Machines from the Cloud","external_id":{"arxiv":["1609.01184"]},"abstract":[{"text":"We consider a scheduling problem where machines need to be rented from the\r\ncloud in order to process jobs. There are two types of machines available which\r\ncan be rented for machine-type dependent prices and for arbitrary durations.\r\nHowever, a machine-type dependent setup time is required before a machine is\r\navailable for processing. Jobs arrive online over time, have machine-type\r\ndependent sizes and have individual deadlines. The objective is to rent\r\nmachines and schedule jobs so as to meet all deadlines while minimizing the\r\nrental cost.\r\n Since we observe the slack of jobs to have a fundamental influence on the\r\ncompetitiveness, we study the model when instances are parameterized by their\r\n(minimum) slack. An instance is called to have a slack of $\\beta$ if, for all\r\njobs, the difference between the job's release time and the latest point in\r\ntime at which it needs to be started is at least $\\beta$. While for $\\beta < s$\r\nno finite competitiveness is possible, our main result is an\r\n$O(\\frac{c}{\\varepsilon} + \\frac{1}{\\varepsilon^3})$-competitive online\r\nalgorithm for $\\beta = (1+\\varepsilon)s$ with $\\frac{1}{s} \\leq \\varepsilon\r\n\\leq 1$, where $s$ and $c$ denotes the largest setup time and the cost ratio of\r\nthe machine-types, respectively. It is complemented by a lower bound of\r\n$\\Omega(\\frac{c}{\\varepsilon})$.","lang":"eng"}],"status":"public","date_created":"2020-04-03T09:24:28Z","author":[{"id":"13536","last_name":"Mäcker","full_name":"Mäcker, Alexander","first_name":"Alexander"},{"last_name":"Malatyali","first_name":"Manuel","full_name":"Malatyali, Manuel"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"full_name":"Riechers, Sören","first_name":"Sören","last_name":"Riechers"}],"department":[{"_id":"63"}],"publication":"arXiv:1609.01184","_id":"16396","date_updated":"2022-01-06T06:52:50Z","language":[{"iso":"eng"}],"type":"preprint","citation":{"short":"A. Mäcker, M. Malatyali, F. Meyer auf der Heide, S. Riechers, ArXiv:1609.01184 (2016).","ieee":"A. Mäcker, M. Malatyali, F. Meyer auf der Heide, and S. Riechers, “Cost-efficient Scheduling on Machines from the Cloud,” arXiv:1609.01184. 2016.","apa":"Mäcker, A., Malatyali, M., Meyer auf der Heide, F., & Riechers, S. (2016). Cost-efficient Scheduling on Machines from the Cloud. ArXiv:1609.01184.","ama":"Mäcker A, Malatyali M, Meyer auf der Heide F, Riechers S. Cost-efficient Scheduling on Machines from the Cloud. arXiv:160901184. 2016.","chicago":"Mäcker, Alexander, Manuel Malatyali, Friedhelm Meyer auf der Heide, and Sören Riechers. “Cost-Efficient Scheduling on Machines from the Cloud.” ArXiv:1609.01184, 2016.","bibtex":"@article{Mäcker_Malatyali_Meyer auf der Heide_Riechers_2016, title={Cost-efficient Scheduling on Machines from the Cloud}, journal={arXiv:1609.01184}, author={Mäcker, Alexander and Malatyali, Manuel and Meyer auf der Heide, Friedhelm and Riechers, Sören}, year={2016} }","mla":"Mäcker, Alexander, et al. “Cost-Efficient Scheduling on Machines from the Cloud.” ArXiv:1609.01184, 2016."},"year":"2016"},{"date_updated":"2022-01-06T06:51:46Z","doi":"10.1007/s10878-015-9915-5","language":[{"iso":"eng"}],"title":"Towards the price of leasing online","department":[{"_id":"63"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Subprojekt C4","_id":"16"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"139","issue":"4","citation":{"ieee":"S. Abshoff, P. Kling, C. Markarian, F. Meyer auf der Heide, and P. Pietrzyk, “Towards the price of leasing online,” Journal of Combinatorial Optimization, no. 4, pp. 1197--1216, 2016.","short":"S. Abshoff, P. Kling, C. Markarian, F. Meyer auf der Heide, P. Pietrzyk, Journal of Combinatorial Optimization (2016) 1197--1216.","bibtex":"@article{Abshoff_Kling_Markarian_Meyer auf der Heide_Pietrzyk_2016, title={Towards the price of leasing online}, DOI={10.1007/s10878-015-9915-5}, number={4}, journal={Journal of Combinatorial Optimization}, publisher={Springer}, author={Abshoff, Sebastian and Kling, Peter and Markarian, Christine and Meyer auf der Heide, Friedhelm and Pietrzyk, Peter }, year={2016}, pages={1197--1216} }","mla":"Abshoff, Sebastian, et al. “Towards the Price of Leasing Online.” Journal of Combinatorial Optimization, no. 4, Springer, 2016, pp. 1197--1216, doi:10.1007/s10878-015-9915-5.","ama":"Abshoff S, Kling P, Markarian C, Meyer auf der Heide F, Pietrzyk P. Towards the price of leasing online. Journal of Combinatorial Optimization. 2016;(4):1197--1216. doi:10.1007/s10878-015-9915-5","apa":"Abshoff, S., Kling, P., Markarian, C., Meyer auf der Heide, F., & Pietrzyk, P. (2016). Towards the price of leasing online. Journal of Combinatorial Optimization, (4), 1197--1216. https://doi.org/10.1007/s10878-015-9915-5","chicago":"Abshoff, Sebastian, Peter Kling, Christine Markarian, Friedhelm Meyer auf der Heide, and Peter Pietrzyk. “Towards the Price of Leasing Online.” Journal of Combinatorial Optimization, no. 4 (2016): 1197--1216. https://doi.org/10.1007/s10878-015-9915-5."},"type":"journal_article","year":"2016","page":" 1197--1216","abstract":[{"lang":"eng","text":"We consider online optimization problems in which certain goods have to be acquired in order to provide a service or infrastructure. Classically, decisions for such problems are considered as final: one buys the goods. However, in many real world applications, there is a shift away from the idea of buying goods. Instead, leasing is often a more flexible and lucrative business model. Research has realized this shift and recently initiated the theoretical study of leasing models (Anthony and Gupta in Proceedings of the integer programming and combinatorial optimization: 12th International IPCO Conference, Ithaca, NY, USA, June 25–27, 2007; Meyerson in Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 23–25 Oct 2005, Pittsburgh, PA, USA, 2005; Nagarajan and Williamson in Discret Optim 10(4):361–370, 2013) We extend this line of work and suggest a more systematic study of leasing aspects for a class of online optimization problems. We provide two major technical results. We introduce the leasing variant of online set multicover and give an O(log(mK)logn)-competitive algorithm (with n, m, and K being the number of elements, sets, and leases, respectively). Our results also imply improvements for the non-leasing variant of online set cover. Moreover, we extend results for the leasing variant of online facility location. Nagarajan and Williamson (Discret Optim 10(4):361–370, 2013) gave an O(Klogn)-competitive algorithm for this problem (with n and K being the number of clients and leases, respectively). We remove the dependency on n (and, thereby, on time). In general, this leads to a bound of O(lmaxloglmax) (with the maximal lease length lmax). For many natural problem instances, the bound improves to O(K2)."}],"user_id":"477","ddc":["000"],"file":[{"success":1,"relation":"main_file","content_type":"application/pdf","date_updated":"2018-11-02T15:57:25Z","file_id":"5318","creator":"ups","file_size":654903,"access_level":"closed","file_name":"Abshoff-TowardsThePriceOfLeasingOnline.pdf","date_created":"2018-11-02T15:57:25Z"}],"author":[{"full_name":"Abshoff, Sebastian","first_name":"Sebastian","last_name":"Abshoff"},{"last_name":"Kling","first_name":"Peter","full_name":"Kling, Peter"},{"last_name":"Markarian","id":"37612","first_name":"Christine","full_name":"Markarian, Christine"},{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"first_name":"Peter ","full_name":"Pietrzyk, Peter ","last_name":"Pietrzyk"}],"publisher":"Springer","file_date_updated":"2018-11-02T15:57:25Z","publication":"Journal of Combinatorial Optimization","has_accepted_license":"1","status":"public","date_created":"2017-10-17T12:41:18Z"},{"title":"The Monotone Circuit Value Problem with Bounded Genus Is in NC","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"department":[{"_id":"63"}],"doi":"10.1007/978-3-319-42634-1_8","date_updated":"2022-01-06T06:51:57Z","language":[{"iso":"eng"}],"series_title":"LNCS","ddc":["000"],"user_id":"477","abstract":[{"lang":"eng","text":"We present an efficient parallel algorithm for the general Monotone Circuit Value Problem (MCVP) with n gates and an underlying graph of bounded genus k. Our algorithm generalizes a recent result by Limaye et al. who showed that MCVP with toroidal embedding (genus 1) is in NC when the input contains a toroidal embedding of the circuit. In addition to extending this result from genus 1 to any bounded genus k, and unlike the work reported by Limaye et al., we do not require a precomputed embedding to be given. Most importantly, our results imply that given a P-complete problem, it is possible to find an algorithm that makes the problem fall into NC by fixing one or more parameters. Hence, we deduce the interesting analogy: Fixed Parameter Parallelizable (FPP) is with respect to P-complete what Fixed Parameter Tractable (FPT) is with respect to NP-complete. Similar work that uses treewidth as parameter was also presented by Elberfeld et al. in [6]."}],"date_created":"2017-10-17T12:41:19Z","status":"public","has_accepted_license":"1","publication":"Proceedings of the 22nd International Conference on Computing and Combinatorics (COCOON)","file_date_updated":"2018-11-02T14:20:45Z","author":[{"last_name":"Abu-Khzam","full_name":"Abu-Khzam, Faisal N. ","first_name":"Faisal N. "},{"first_name":"Shouwei","full_name":"Li, Shouwei","last_name":"Li"},{"last_name":"Markarian","id":"37612","first_name":"Christine","full_name":"Markarian, Christine"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"last_name":"Podlipyan","first_name":"Pavel","full_name":"Podlipyan, Pavel"}],"file":[{"date_created":"2018-11-02T14:20:45Z","file_name":"TheMonotoneCircuitValueProblem.pdf","access_level":"closed","file_size":234587,"file_id":"5269","creator":"ups","date_updated":"2018-11-02T14:20:45Z","content_type":"application/pdf","success":1,"relation":"main_file"}],"_id":"143","page":"92-102","year":"2016","citation":{"ieee":"F. N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, and P. Podlipyan, “The Monotone Circuit Value Problem with Bounded Genus Is in NC,” in Proceedings of the 22nd International Conference on Computing and Combinatorics (COCOON), 2016, pp. 92–102.","short":"F.N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, P. Podlipyan, in: Proceedings of the 22nd International Conference on Computing and Combinatorics (COCOON), 2016, pp. 92–102.","mla":"Abu-Khzam, Faisal N., et al. “The Monotone Circuit Value Problem with Bounded Genus Is in NC.” Proceedings of the 22nd International Conference on Computing and Combinatorics (COCOON), 2016, pp. 92–102, doi:10.1007/978-3-319-42634-1_8.","bibtex":"@inproceedings{Abu-Khzam_Li_Markarian_Meyer auf der Heide_Podlipyan_2016, series={LNCS}, title={The Monotone Circuit Value Problem with Bounded Genus Is in NC}, DOI={10.1007/978-3-319-42634-1_8}, booktitle={Proceedings of the 22nd International Conference on Computing and Combinatorics (COCOON)}, author={Abu-Khzam, Faisal N. and Li, Shouwei and Markarian, Christine and Meyer auf der Heide, Friedhelm and Podlipyan, Pavel}, year={2016}, pages={92–102}, collection={LNCS} }","ama":"Abu-Khzam FN, Li S, Markarian C, Meyer auf der Heide F, Podlipyan P. The Monotone Circuit Value Problem with Bounded Genus Is in NC. In: Proceedings of the 22nd International Conference on Computing and Combinatorics (COCOON). LNCS. ; 2016:92-102. doi:10.1007/978-3-319-42634-1_8","apa":"Abu-Khzam, F. N., Li, S., Markarian, C., Meyer auf der Heide, F., & Podlipyan, P. (2016). The Monotone Circuit Value Problem with Bounded Genus Is in NC. In Proceedings of the 22nd International Conference on Computing and Combinatorics (COCOON) (pp. 92–102). https://doi.org/10.1007/978-3-319-42634-1_8","chicago":"Abu-Khzam, Faisal N. , Shouwei Li, Christine Markarian, Friedhelm Meyer auf der Heide, and Pavel Podlipyan. “The Monotone Circuit Value Problem with Bounded Genus Is in NC.” In Proceedings of the 22nd International Conference on Computing and Combinatorics (COCOON), 92–102. LNCS, 2016. https://doi.org/10.1007/978-3-319-42634-1_8."},"type":"conference"},{"intvolume":" 28","_id":"145","issue":"5","page":"1655-1677","citation":{"bibtex":"@article{Feldotto_Graffi_2016, title={Systematic evaluation of peer-to-peer systems using PeerfactSim.KOM}, volume={28}, DOI={10.1002/cpe.3716}, number={5}, journal={Concurrency and Computation: Practice and Experience}, publisher={Wiley Online Library}, author={Feldotto, Matthias and Graffi, Kalman}, year={2016}, pages={1655–1677} }","mla":"Feldotto, Matthias, and Kalman Graffi. “Systematic Evaluation of Peer-to-Peer Systems Using PeerfactSim.KOM.” Concurrency and Computation: Practice and Experience, vol. 28, no. 5, Wiley Online Library, 2016, pp. 1655–77, doi:10.1002/cpe.3716.","chicago":"Feldotto, Matthias, and Kalman Graffi. “Systematic Evaluation of Peer-to-Peer Systems Using PeerfactSim.KOM.” Concurrency and Computation: Practice and Experience 28, no. 5 (2016): 1655–77. https://doi.org/10.1002/cpe.3716.","apa":"Feldotto, M., & Graffi, K. (2016). Systematic evaluation of peer-to-peer systems using PeerfactSim.KOM. Concurrency and Computation: Practice and Experience, 28(5), 1655–1677. https://doi.org/10.1002/cpe.3716","ama":"Feldotto M, Graffi K. Systematic evaluation of peer-to-peer systems using PeerfactSim.KOM. Concurrency and Computation: Practice and Experience. 2016;28(5):1655-1677. doi:10.1002/cpe.3716","ieee":"M. Feldotto and K. Graffi, “Systematic evaluation of peer-to-peer systems using PeerfactSim.KOM,” Concurrency and Computation: Practice and Experience, vol. 28, no. 5, pp. 1655–1677, 2016.","short":"M. Feldotto, K. Graffi, Concurrency and Computation: Practice and Experience 28 (2016) 1655–1677."},"year":"2016","type":"journal_article","abstract":[{"lang":"eng","text":"Comparative evaluations of peer-to-peer protocols through simulations are a viable approach to judge the performance and costs of the individual protocols in large-scale networks. In order to support this work, we present the peer-to-peer system simulator PeerfactSim.KOM, which we extended over the last years. PeerfactSim.KOM comes with an extensive layer model to support various facets and protocols of peer-to-peer networking. In this article, we describe PeerfactSim.KOM and show how it can be used for detailed measurements of large-scale peer-to-peer networks. We enhanced PeerfactSim.KOM with a fine-grained analyzer concept, with exhaustive automated measurements and gnuplot generators as well as a coordination control to evaluate sets of experiment setups in parallel. Thus, by configuring all experiments and protocols only once and starting the simulator, all desired measurements are performed, analyzed, evaluated, and combined, resulting in a holistic environment for the comparative evaluation of peer-to-peer systems. An immediate comparison of different configurations and overlays under different aspects is possible directly after the execution without any manual post-processing. "}],"ddc":["040"],"user_id":"14052","publication":"Concurrency and Computation: Practice and Experience","file_date_updated":"2018-03-21T12:57:57Z","author":[{"orcid":"0000-0003-1348-6516","full_name":"Feldotto, Matthias","first_name":"Matthias","id":"14052","last_name":"Feldotto"},{"full_name":"Graffi, Kalman","first_name":"Kalman","last_name":"Graffi"}],"publisher":"Wiley Online Library","file":[{"access_level":"closed","file_name":"145-Feldotto_et_al-2016-Concurrency_and_Computation-_Practice_and_Experience.pdf","date_created":"2018-03-21T12:57:57Z","date_updated":"2018-03-21T12:57:57Z","content_type":"application/pdf","success":1,"relation":"main_file","file_size":3121363,"creator":"florida","file_id":"1556"}],"volume":28,"date_created":"2017-10-17T12:41:20Z","status":"public","has_accepted_license":"1","date_updated":"2022-01-06T06:52:00Z","doi":"10.1002/cpe.3716","title":"Systematic evaluation of peer-to-peer systems using PeerfactSim.KOM","department":[{"_id":"79"},{"_id":"63"},{"_id":"541"}],"publication_status":"published","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}]},{"department":[{"_id":"63"},{"_id":"541"}],"author":[{"full_name":"Pfannschmidt, Karlson","first_name":"Karlson","last_name":"Pfannschmidt"}],"publisher":"Universität Paderborn","date_created":"2017-10-17T12:41:41Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"name":"SFB 901 - Project Area A","_id":"2"}],"status":"public","title":"Solving the aggregated bandits problem","user_id":"14052","type":"mastersthesis","year":"2015","citation":{"bibtex":"@book{Pfannschmidt_2015, title={Solving the aggregated bandits problem}, publisher={Universität Paderborn}, author={Pfannschmidt, Karlson}, year={2015} }","mla":"Pfannschmidt, Karlson. Solving the Aggregated Bandits Problem. Universität Paderborn, 2015.","apa":"Pfannschmidt, K. (2015). Solving the aggregated bandits problem. Universität Paderborn.","ama":"Pfannschmidt K. Solving the Aggregated Bandits Problem. Universität Paderborn; 2015.","chicago":"Pfannschmidt, Karlson. Solving the Aggregated Bandits Problem. Universität Paderborn, 2015.","ieee":"K. Pfannschmidt, Solving the aggregated bandits problem. Universität Paderborn, 2015.","short":"K. Pfannschmidt, Solving the Aggregated Bandits Problem, Universität Paderborn, 2015."},"supervisor":[{"full_name":"Skopalik, Alexander","first_name":"Alexander","id":"40384","last_name":"Skopalik"}],"_id":"251","date_updated":"2022-01-06T06:56:50Z"},{"language":[{"iso":"eng"}],"year":"2015","type":"conference","citation":{"ieee":"M. Wahby and H. Hamann, “On the Tradeoff between Hardware Protection and Optimization Success: A Case Study in Onboard Evolutionary Robotics for Autonomous Parallel Parking,” in Applications of Evolutionary Computation (EvoApplications 2015), 2015.","short":"M. Wahby, H. Hamann, in: Applications of Evolutionary Computation (EvoApplications 2015), 2015.","mla":"Wahby, Mostafa, and Heiko Hamann. “On the Tradeoff between Hardware Protection and Optimization Success: A Case Study in Onboard Evolutionary Robotics for Autonomous Parallel Parking.” Applications of Evolutionary Computation (EvoApplications 2015), 2015, doi:10.1007/978-3-319-16549-3_61.","bibtex":"@inproceedings{Wahby_Hamann_2015, title={On the Tradeoff between Hardware Protection and Optimization Success: A Case Study in Onboard Evolutionary Robotics for Autonomous Parallel Parking}, DOI={10.1007/978-3-319-16549-3_61}, booktitle={Applications of Evolutionary Computation (EvoApplications 2015)}, author={Wahby, Mostafa and Hamann, Heiko}, year={2015} }","apa":"Wahby, M., & Hamann, H. (2015). On the Tradeoff between Hardware Protection and Optimization Success: A Case Study in Onboard Evolutionary Robotics for Autonomous Parallel Parking. In Applications of Evolutionary Computation (EvoApplications 2015). https://doi.org/10.1007/978-3-319-16549-3_61","ama":"Wahby M, Hamann H. On the Tradeoff between Hardware Protection and Optimization Success: A Case Study in Onboard Evolutionary Robotics for Autonomous Parallel Parking. In: Applications of Evolutionary Computation (EvoApplications 2015). ; 2015. doi:10.1007/978-3-319-16549-3_61","chicago":"Wahby, Mostafa, and Heiko Hamann. “On the Tradeoff between Hardware Protection and Optimization Success: A Case Study in Onboard Evolutionary Robotics for Autonomous Parallel Parking.” In Applications of Evolutionary Computation (EvoApplications 2015), 2015. https://doi.org/10.1007/978-3-319-16549-3_61."},"_id":"19959","date_updated":"2022-01-06T06:54:17Z","doi":"10.1007/978-3-319-16549-3_61","department":[{"_id":"63"},{"_id":"238"}],"publication":"Applications of Evolutionary Computation (EvoApplications 2015)","author":[{"last_name":"Wahby","full_name":"Wahby, Mostafa","first_name":"Mostafa"},{"full_name":"Hamann, Heiko","first_name":"Heiko","last_name":"Hamann"}],"date_created":"2020-10-08T12:36:48Z","status":"public","user_id":"15415","title":"On the Tradeoff between Hardware Protection and Optimization Success: A Case Study in Onboard Evolutionary Robotics for Autonomous Parallel Parking"},{"doi":"10.1109/ssci.2015.158","date_updated":"2022-01-06T06:54:17Z","_id":"19960","year":"2015","type":"conference","citation":{"ieee":"H. Hamann et al., “Flora Robotica - Mixed Societies of Symbiotic Robot-Plant Bio-Hybrids,” in Proceedings of the 2015 IEEE Symposium on Artificial Life (IEEE ALIFE’15), 2015.","short":"H. Hamann, M. Wahby, T. Schmickl, P. Zahadat, D. Hofstadler, K. Stoy, S. Risi, A. Faina, F. Veenstra, S. Kernbach, I. Kuksin, O. Kernbach, P. Ayres, P. Wojtaszek, in: Proceedings of the 2015 IEEE Symposium on Artificial Life (IEEE ALIFE’15), 2015.","mla":"Hamann, Heiko, et al. “Flora Robotica - Mixed Societies of Symbiotic Robot-Plant Bio-Hybrids.” Proceedings of the 2015 IEEE Symposium on Artificial Life (IEEE ALIFE’15), 2015, doi:10.1109/ssci.2015.158.","bibtex":"@inproceedings{Hamann_Wahby_Schmickl_Zahadat_Hofstadler_Stoy_Risi_Faina_Veenstra_Kernbach_et al._2015, title={Flora Robotica - Mixed Societies of Symbiotic Robot-Plant Bio-Hybrids}, DOI={10.1109/ssci.2015.158}, booktitle={Proceedings of the 2015 IEEE Symposium on Artificial Life (IEEE ALIFE’15)}, author={Hamann, Heiko and Wahby, Mostafa and Schmickl, Thomas and Zahadat, Payam and Hofstadler, Daniel and Stoy, Kasper and Risi, Sebastian and Faina, Andres and Veenstra, Frank and Kernbach, Serge and et al.}, year={2015} }","ama":"Hamann H, Wahby M, Schmickl T, et al. Flora Robotica - Mixed Societies of Symbiotic Robot-Plant Bio-Hybrids. In: Proceedings of the 2015 IEEE Symposium on Artificial Life (IEEE ALIFE’15). ; 2015. doi:10.1109/ssci.2015.158","apa":"Hamann, H., Wahby, M., Schmickl, T., Zahadat, P., Hofstadler, D., Stoy, K., … Wojtaszek, P. (2015). Flora Robotica - Mixed Societies of Symbiotic Robot-Plant Bio-Hybrids. In Proceedings of the 2015 IEEE Symposium on Artificial Life (IEEE ALIFE’15). https://doi.org/10.1109/ssci.2015.158","chicago":"Hamann, Heiko, Mostafa Wahby, Thomas Schmickl, Payam Zahadat, Daniel Hofstadler, Kasper Stoy, Sebastian Risi, et al. “Flora Robotica - Mixed Societies of Symbiotic Robot-Plant Bio-Hybrids.” In Proceedings of the 2015 IEEE Symposium on Artificial Life (IEEE ALIFE’15), 2015. https://doi.org/10.1109/ssci.2015.158."},"language":[{"iso":"eng"}],"title":"Flora Robotica - Mixed Societies of Symbiotic Robot-Plant Bio-Hybrids","user_id":"15415","abstract":[{"lang":"eng","text":"Besides the life-as-it-could-be driver of artificial life research there is also the concept of extending natural life by creating hybrids or mixed societies that are built from natural and artificial components. In this paper we motivate and present the research program of the project flora robotica. Our objective is to develop and to investigate closely linked symbiotic relationships between robots and natural plants and to explore the potentials of a plant-robot society able to produce architectural artifacts and living spaces. These robot-plant bio-hybrids create synergies that allow for new functions of plants and robots. They also create novel design opportunities for an architecture that fuses the design and construction phase. The bio-hybrid is an example of mixed societies between 'hard' artificial and 'wet' natural life, which enables an interaction between natural and artificial ecologies. They form an embodied, self-organizing, and distributed cognitive system which is supposed to grow and develop over long periods of time resulting in the creation of meaningful architectural structures. A key idea is to assign equal roles to robots and plants in order to create a highly integrated, symbiotic system. Besides the gain of knowledge, this project has the objective to create a bio-hybrid system with a defined function and application -- growing architectural artifacts."}],"publication_identifier":{"isbn":["9781479975600"]},"publication_status":"published","date_created":"2020-10-08T12:44:10Z","status":"public","department":[{"_id":"63"},{"_id":"238"}],"publication":"Proceedings of the 2015 IEEE Symposium on Artificial Life (IEEE ALIFE'15)","author":[{"full_name":"Hamann, Heiko","first_name":"Heiko","last_name":"Hamann"},{"last_name":"Wahby","first_name":"Mostafa","full_name":"Wahby, Mostafa"},{"full_name":"Schmickl, Thomas","first_name":"Thomas","last_name":"Schmickl"},{"last_name":"Zahadat","full_name":"Zahadat, Payam","first_name":"Payam"},{"full_name":"Hofstadler, Daniel","first_name":"Daniel","last_name":"Hofstadler"},{"full_name":"Stoy, Kasper","first_name":"Kasper","last_name":"Stoy"},{"full_name":"Risi, Sebastian","first_name":"Sebastian","last_name":"Risi"},{"first_name":"Andres","full_name":"Faina, Andres","last_name":"Faina"},{"last_name":"Veenstra","first_name":"Frank","full_name":"Veenstra, Frank"},{"last_name":"Kernbach","full_name":"Kernbach, Serge","first_name":"Serge"},{"full_name":"Kuksin, Igor","first_name":"Igor","last_name":"Kuksin"},{"last_name":"Kernbach","first_name":"Olga","full_name":"Kernbach, Olga"},{"last_name":"Ayres","full_name":"Ayres, Phil","first_name":"Phil"},{"first_name":"Przemyslaw","full_name":"Wojtaszek, Przemyslaw","last_name":"Wojtaszek"}]},{"date_updated":"2022-01-06T06:54:17Z","_id":"19962","doi":"10.1162/artl_a_00186","language":[{"iso":"eng"}],"page":"464-480","type":"journal_article","year":"2015","citation":{"bibtex":"@article{Hamann_2015, title={Lessons from Speciation Dynamics: How to Generate Selective Pressure Towards Diversity}, DOI={10.1162/artl_a_00186}, journal={Artificial Life}, author={Hamann, Heiko}, year={2015}, pages={464–480} }","mla":"Hamann, Heiko. “Lessons from Speciation Dynamics: How to Generate Selective Pressure Towards Diversity.” Artificial Life, 2015, pp. 464–80, doi:10.1162/artl_a_00186.","apa":"Hamann, H. (2015). Lessons from Speciation Dynamics: How to Generate Selective Pressure Towards Diversity. Artificial Life, 464–480. https://doi.org/10.1162/artl_a_00186","ama":"Hamann H. Lessons from Speciation Dynamics: How to Generate Selective Pressure Towards Diversity. Artificial Life. 2015:464-480. doi:10.1162/artl_a_00186","chicago":"Hamann, Heiko. “Lessons from Speciation Dynamics: How to Generate Selective Pressure Towards Diversity.” Artificial Life, 2015, 464–80. https://doi.org/10.1162/artl_a_00186.","ieee":"H. Hamann, “Lessons from Speciation Dynamics: How to Generate Selective Pressure Towards Diversity,” Artificial Life, pp. 464–480, 2015.","short":"H. Hamann, Artificial Life (2015) 464–480."},"abstract":[{"lang":"eng","text":"Recent approaches in evolutionary robotics (ER) propose to generate behavioral diversity in order to evolve desired behaviors more easily. These approaches require the definition of a behavioral distance, which often includes task-specific features and hence a priori knowledge. Alternative methods, which do not explicitly force selective pressure towards diversity (SPTD) but still generate it, are known from the field of artificial life, such as in artificial ecologies (AEs). In this study, we investigate how SPTD is generated without task-specific behavioral features or other forms of a priori knowledge and detect how methods of generating SPTD can be transferred from the domain of AE to ER. A promising finding is that in both types of systems, in systems from ER that generate behavioral diversity and also in the investigated speciation model, selective pressure is generated towards unpopulated regions of search space. In a simple case study we investigate the practical implications of these findings and point to options for transferring the idea of self-organizing SPTD in AEs to the domain of ER."}],"user_id":"15415","title":"Lessons from Speciation Dynamics: How to Generate Selective Pressure Towards Diversity","publication":"Artificial Life","department":[{"_id":"63"},{"_id":"238"}],"author":[{"last_name":"Hamann","first_name":"Heiko","full_name":"Hamann, Heiko"}],"date_created":"2020-10-08T14:36:25Z","status":"public","publication_identifier":{"issn":["1064-5462","1530-9185"]},"publication_status":"published"},{"publication":"Proceedings of the 9th EAI International Conference on Bio-inspired Information and Communications Technologies (formerly BIONETICS)","department":[{"_id":"63"},{"_id":"238"}],"author":[{"last_name":"Wahby","first_name":"Mostafa","full_name":"Wahby, Mostafa"},{"last_name":"Weinhold","first_name":"Alexander","full_name":"Weinhold, Alexander"},{"last_name":"Hamann","full_name":"Hamann, Heiko","first_name":"Heiko"}],"publication_identifier":{"isbn":["9781631901003"]},"publication_status":"published","date_created":"2020-10-09T13:41:56Z","status":"public","abstract":[{"text":"Aggregation is a crucial task in swarm robotics to ensure cooperation. We investigate the task of aggregation on an area specified indirectly by certain environmental features, here it is a light distribution. We extend the original BEECLUST algorithm, that implements an aggregation behavior, to an adaptive variant that automatically adapts to any light conditions. We compare these two control algorithms in a number of swarm robot experiments with different light conditions. The improved, adaptive variant is found to be significantly better in the tested setup.","lang":"eng"}],"title":"Revisiting BEECLUST: Aggregation of Swarm Robots with Adaptiveness to Different Light Settings","user_id":"15415","citation":{"ieee":"M. Wahby, A. Weinhold, and H. Hamann, “Revisiting BEECLUST: Aggregation of Swarm Robots with Adaptiveness to Different Light Settings,” in Proceedings of the 9th EAI International Conference on Bio-inspired Information and Communications Technologies (formerly BIONETICS), 2015.","short":"M. Wahby, A. Weinhold, H. Hamann, in: Proceedings of the 9th EAI International Conference on Bio-Inspired Information and Communications Technologies (Formerly BIONETICS), 2015.","bibtex":"@inproceedings{Wahby_Weinhold_Hamann_2015, title={Revisiting BEECLUST: Aggregation of Swarm Robots with Adaptiveness to Different Light Settings}, DOI={10.4108/eai.3-12-2015.2262877}, booktitle={Proceedings of the 9th EAI International Conference on Bio-inspired Information and Communications Technologies (formerly BIONETICS)}, author={Wahby, Mostafa and Weinhold, Alexander and Hamann, Heiko}, year={2015} }","mla":"Wahby, Mostafa, et al. “Revisiting BEECLUST: Aggregation of Swarm Robots with Adaptiveness to Different Light Settings.” Proceedings of the 9th EAI International Conference on Bio-Inspired Information and Communications Technologies (Formerly BIONETICS), 2015, doi:10.4108/eai.3-12-2015.2262877.","chicago":"Wahby, Mostafa, Alexander Weinhold, and Heiko Hamann. “Revisiting BEECLUST: Aggregation of Swarm Robots with Adaptiveness to Different Light Settings.” In Proceedings of the 9th EAI International Conference on Bio-Inspired Information and Communications Technologies (Formerly BIONETICS), 2015. https://doi.org/10.4108/eai.3-12-2015.2262877.","ama":"Wahby M, Weinhold A, Hamann H. Revisiting BEECLUST: Aggregation of Swarm Robots with Adaptiveness to Different Light Settings. In: Proceedings of the 9th EAI International Conference on Bio-Inspired Information and Communications Technologies (Formerly BIONETICS). ; 2015. doi:10.4108/eai.3-12-2015.2262877","apa":"Wahby, M., Weinhold, A., & Hamann, H. (2015). Revisiting BEECLUST: Aggregation of Swarm Robots with Adaptiveness to Different Light Settings. In Proceedings of the 9th EAI International Conference on Bio-inspired Information and Communications Technologies (formerly BIONETICS). https://doi.org/10.4108/eai.3-12-2015.2262877"},"year":"2015","type":"conference","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:54:17Z","_id":"19966","doi":"10.4108/eai.3-12-2015.2262877"},{"author":[{"last_name":"Wahby","first_name":"Mostafa","full_name":"Wahby, Mostafa"},{"first_name":"Mohammad","full_name":"Divband Soorati, Mohammad","last_name":"Divband Soorati"},{"first_name":"Sebastian","full_name":"von Mammen, Sebastian","last_name":"von Mammen"},{"last_name":"Hamann","full_name":"Hamann, Heiko","first_name":"Heiko"}],"department":[{"_id":"63"},{"_id":"238"}],"publication":"Proceedings. 25. Computational Intelligence Workshop","status":"public","date_created":"2020-10-09T13:50:38Z","user_id":"15415","title":"Evolution of Controllers for Robot-Plant Bio-Hybdrids: A Simple Case Study Using a Model of Plant Growth and Motion","language":[{"iso":"eng"}],"year":"2015","citation":{"bibtex":"@inproceedings{Wahby_Divband Soorati_von Mammen_Hamann_2015, title={Evolution of Controllers for Robot-Plant Bio-Hybdrids: A Simple Case Study Using a Model of Plant Growth and Motion}, booktitle={Proceedings. 25. Computational Intelligence Workshop}, author={Wahby, Mostafa and Divband Soorati, Mohammad and von Mammen, Sebastian and Hamann, Heiko}, year={2015} }","mla":"Wahby, Mostafa, et al. “Evolution of Controllers for Robot-Plant Bio-Hybdrids: A Simple Case Study Using a Model of Plant Growth and Motion.” Proceedings. 25. Computational Intelligence Workshop, 2015.","chicago":"Wahby, Mostafa, Mohammad Divband Soorati, Sebastian von Mammen, and Heiko Hamann. “Evolution of Controllers for Robot-Plant Bio-Hybdrids: A Simple Case Study Using a Model of Plant Growth and Motion.” In Proceedings. 25. Computational Intelligence Workshop, 2015.","apa":"Wahby, M., Divband Soorati, M., von Mammen, S., & Hamann, H. (2015). Evolution of Controllers for Robot-Plant Bio-Hybdrids: A Simple Case Study Using a Model of Plant Growth and Motion. In Proceedings. 25. Computational Intelligence Workshop.","ama":"Wahby M, Divband Soorati M, von Mammen S, Hamann H. Evolution of Controllers for Robot-Plant Bio-Hybdrids: A Simple Case Study Using a Model of Plant Growth and Motion. In: Proceedings. 25. Computational Intelligence Workshop. ; 2015.","ieee":"M. Wahby, M. Divband Soorati, S. von Mammen, and H. Hamann, “Evolution of Controllers for Robot-Plant Bio-Hybdrids: A Simple Case Study Using a Model of Plant Growth and Motion,” in Proceedings. 25. Computational Intelligence Workshop, 2015.","short":"M. Wahby, M. Divband Soorati, S. von Mammen, H. Hamann, in: Proceedings. 25. Computational Intelligence Workshop, 2015."},"type":"conference","_id":"19967","date_updated":"2022-01-06T06:54:17Z"},{"abstract":[{"text":"Fitness function design is known to be a critical feature of the evolutionary-robotics approach. Potentially, the complexity of evolving a successful controller for a given task can be reduced by integrating a priori knowledge into the fitness function which complicates the comparability of studies in evolutionary robotics. Still, there are only few publications that study the actual effects of different fitness functions on the robot's performance. In this paper, we follow the fitness function classification of Nelson et al. (2009) and investigate a selection of four classes of fitness functions that require different degrees of a priori knowledge. The robot controllers are evolved in simulation using NEAT and we investigate different tasks including obstacle avoidance and (periodic) goal homing. The best evolved controllers were then post-evaluated by examining their potential for adaptation, determining their convergence rates, and using cross-comparisons based on the different fitness function classes. The results confirm that the integration of more a priori knowledge can simplify a task and show that more attention should be paid to fitness function classes when comparing different studies.","lang":"eng"}],"title":"The Effect of Fitness Function Design on Performance in Evolutionary Robotics: The Influence of a Priori Knowledge","user_id":"15415","publication":"Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2015)","department":[{"_id":"63"},{"_id":"238"}],"author":[{"first_name":"Heiko","full_name":"Hamann, Heiko","last_name":"Hamann"},{"full_name":"Divband Soorati, Mohammad","first_name":"Mohammad","last_name":"Divband Soorati"}],"publisher":"ACM","date_created":"2020-10-12T13:12:25Z","status":"public","_id":"19980","date_updated":"2022-01-06T06:54:17Z","doi":"10.1145/2739480.2754676","page":"153-160","citation":{"short":"H. Hamann, M. Divband Soorati, in: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2015), ACM, 2015, pp. 153–160.","ieee":"H. Hamann and M. Divband Soorati, “The Effect of Fitness Function Design on Performance in Evolutionary Robotics: The Influence of a Priori Knowledge,” in Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2015), 2015, pp. 153–160.","ama":"Hamann H, Divband Soorati M. The Effect of Fitness Function Design on Performance in Evolutionary Robotics: The Influence of a Priori Knowledge. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2015). ACM; 2015:153-160. doi:10.1145/2739480.2754676","apa":"Hamann, H., & Divband Soorati, M. (2015). The Effect of Fitness Function Design on Performance in Evolutionary Robotics: The Influence of a Priori Knowledge. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2015) (pp. 153–160). ACM. https://doi.org/10.1145/2739480.2754676","chicago":"Hamann, Heiko, and Mohammad Divband Soorati. “The Effect of Fitness Function Design on Performance in Evolutionary Robotics: The Influence of a Priori Knowledge.” In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2015), 153–60. ACM, 2015. https://doi.org/10.1145/2739480.2754676.","mla":"Hamann, Heiko, and Mohammad Divband Soorati. “The Effect of Fitness Function Design on Performance in Evolutionary Robotics: The Influence of a Priori Knowledge.” Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2015), ACM, 2015, pp. 153–60, doi:10.1145/2739480.2754676.","bibtex":"@inproceedings{Hamann_Divband Soorati_2015, title={The Effect of Fitness Function Design on Performance in Evolutionary Robotics: The Influence of a Priori Knowledge}, DOI={10.1145/2739480.2754676}, booktitle={Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2015)}, publisher={ACM}, author={Hamann, Heiko and Divband Soorati, Mohammad}, year={2015}, pages={153–160} }"},"type":"conference","year":"2015","language":[{"iso":"eng"}]},{"language":[{"iso":"eng"}],"page":"174","year":"2015","citation":{"chicago":"Hamann, Heiko, Thomas Schmickl, and Payam Zahadat. “Evolving Collective Behaviors With Diverse But Predictable Sensor States.” In 13th European Conference on Artificial Life (ECAL 2015), 174. MIT Press, 2015. https://doi.org/10.7551/978-0-262-33027-5-ch036.","ama":"Hamann H, Schmickl T, Zahadat P. Evolving Collective Behaviors With Diverse But Predictable Sensor States. In: 13th European Conference on Artificial Life (ECAL 2015). MIT Press; 2015:174. doi:10.7551/978-0-262-33027-5-ch036","apa":"Hamann, H., Schmickl, T., & Zahadat, P. (2015). Evolving Collective Behaviors With Diverse But Predictable Sensor States. In 13th European Conference on Artificial Life (ECAL 2015) (p. 174). MIT Press. https://doi.org/10.7551/978-0-262-33027-5-ch036","mla":"Hamann, Heiko, et al. “Evolving Collective Behaviors With Diverse But Predictable Sensor States.” 13th European Conference on Artificial Life (ECAL 2015), MIT Press, 2015, p. 174, doi:10.7551/978-0-262-33027-5-ch036.","bibtex":"@inproceedings{Hamann_Schmickl_Zahadat_2015, title={Evolving Collective Behaviors With Diverse But Predictable Sensor States}, DOI={10.7551/978-0-262-33027-5-ch036}, booktitle={13th European Conference on Artificial Life (ECAL 2015)}, publisher={MIT Press}, author={Hamann, Heiko and Schmickl, Thomas and Zahadat, Payam}, year={2015}, pages={174} }","short":"H. Hamann, T. Schmickl, P. Zahadat, in: 13th European Conference on Artificial Life (ECAL 2015), MIT Press, 2015, p. 174.","ieee":"H. Hamann, T. Schmickl, and P. Zahadat, “Evolving Collective Behaviors With Diverse But Predictable Sensor States,” in 13th European Conference on Artificial Life (ECAL 2015), 2015, p. 174."},"type":"conference","date_updated":"2022-01-06T06:54:17Z","_id":"19988","doi":"10.7551/978-0-262-33027-5-ch036","publication":"13th European Conference on Artificial Life (ECAL 2015)","department":[{"_id":"63"},{"_id":"238"}],"author":[{"first_name":"Heiko","full_name":"Hamann, Heiko","last_name":"Hamann"},{"last_name":"Schmickl","first_name":"Thomas","full_name":"Schmickl, Thomas"},{"last_name":"Zahadat","first_name":"Payam","full_name":"Zahadat, Payam"}],"publisher":"MIT Press","date_created":"2020-10-13T08:50:38Z","status":"public","user_id":"15415","title":"Evolving Collective Behaviors With Diverse But Predictable Sensor States"},{"date_updated":"2022-01-06T06:54:17Z","_id":"19989","doi":"10.1007/978-3-662-43505-2_74","language":[{"iso":"eng"}],"page":"1423-1431","citation":{"ama":"Hamann H, Correll N, Kacprzyk J, Pedrycz W. Probabilistic Modeling of Swarming Systems. In: Springer Handbook of Computational Intelligence. Springer; 2015:1423-1431. doi:10.1007/978-3-662-43505-2_74","apa":"Hamann, H., Correll, N., Kacprzyk, J., & Pedrycz, W. (2015). Probabilistic Modeling of Swarming Systems. In Springer Handbook of Computational Intelligence (pp. 1423–1431). Springer. https://doi.org/10.1007/978-3-662-43505-2_74","chicago":"Hamann, Heiko, Nikolaus Correll, Janusz Kacprzyk, and Witold Pedrycz. “Probabilistic Modeling of Swarming Systems.” In Springer Handbook of Computational Intelligence, 1423–31. Springer, 2015. https://doi.org/10.1007/978-3-662-43505-2_74.","mla":"Hamann, Heiko, et al. “Probabilistic Modeling of Swarming Systems.” Springer Handbook of Computational Intelligence, Springer, 2015, pp. 1423–31, doi:10.1007/978-3-662-43505-2_74.","bibtex":"@inbook{Hamann_Correll_Kacprzyk_Pedrycz_2015, title={Probabilistic Modeling of Swarming Systems}, DOI={10.1007/978-3-662-43505-2_74}, booktitle={Springer Handbook of Computational Intelligence}, publisher={Springer}, author={Hamann, Heiko and Correll, Nikolaus and Kacprzyk, Janusz and Pedrycz, Witold}, year={2015}, pages={1423–1431} }","short":"H. Hamann, N. Correll, J. Kacprzyk, W. Pedrycz, in: Springer Handbook of Computational Intelligence, Springer, 2015, pp. 1423–1431.","ieee":"H. Hamann, N. Correll, J. Kacprzyk, and W. Pedrycz, “Probabilistic Modeling of Swarming Systems,” in Springer Handbook of Computational Intelligence, Springer, 2015, pp. 1423–1431."},"year":"2015","type":"book_chapter","user_id":"15415","title":"Probabilistic Modeling of Swarming Systems","department":[{"_id":"63"},{"_id":"238"}],"publication":"Springer Handbook of Computational Intelligence","publisher":"Springer","author":[{"last_name":"Hamann","full_name":"Hamann, Heiko","first_name":"Heiko"},{"first_name":"Nikolaus","full_name":"Correll, Nikolaus","last_name":"Correll"},{"full_name":"Kacprzyk, Janusz","first_name":"Janusz","last_name":"Kacprzyk"},{"full_name":"Pedrycz, Witold","first_name":"Witold","last_name":"Pedrycz"}],"date_created":"2020-10-13T09:04:19Z","status":"public"},{"citation":{"chicago":"Ding, Hongli, and Heiko Hamann. “Dependability in Swarm Robotics: Error Detection and Correction.” In First International Symposium on Swarm Behavior and Bio-Inspired Robotics (SWARM 2015), 2015.","ama":"Ding H, Hamann H. Dependability in Swarm Robotics: Error Detection and Correction. In: First International Symposium on Swarm Behavior and Bio-Inspired Robotics (SWARM 2015). ; 2015.","apa":"Ding, H., & Hamann, H. (2015). Dependability in Swarm Robotics: Error Detection and Correction. In First International Symposium on Swarm Behavior and Bio-Inspired Robotics (SWARM 2015).","bibtex":"@inproceedings{Ding_Hamann_2015, title={Dependability in Swarm Robotics: Error Detection and Correction}, booktitle={First International Symposium on Swarm Behavior and Bio-Inspired Robotics (SWARM 2015)}, author={Ding, Hongli and Hamann, Heiko}, year={2015} }","mla":"Ding, Hongli, and Heiko Hamann. “Dependability in Swarm Robotics: Error Detection and Correction.” First International Symposium on Swarm Behavior and Bio-Inspired Robotics (SWARM 2015), 2015.","short":"H. Ding, H. Hamann, in: First International Symposium on Swarm Behavior and Bio-Inspired Robotics (SWARM 2015), 2015.","ieee":"H. Ding and H. Hamann, “Dependability in Swarm Robotics: Error Detection and Correction,” in First International Symposium on Swarm Behavior and Bio-Inspired Robotics (SWARM 2015), 2015."},"year":"2015","type":"conference","language":[{"iso":"eng"}],"_id":"19990","date_updated":"2022-01-06T06:54:17Z","status":"public","date_created":"2020-10-13T09:09:20Z","author":[{"full_name":"Ding, Hongli","first_name":"Hongli","last_name":"Ding"},{"full_name":"Hamann, Heiko","first_name":"Heiko","last_name":"Hamann"}],"publication":"First International Symposium on Swarm Behavior and Bio-Inspired Robotics (SWARM 2015)","department":[{"_id":"63"},{"_id":"238"}],"title":"Dependability in Swarm Robotics: Error Detection and Correction","user_id":"15415"},{"status":"public","date_created":"2020-10-13T09:24:32Z","author":[{"full_name":"Hamann, Heiko","first_name":"Heiko","last_name":"Hamann"},{"last_name":"Schmickl","full_name":"Schmickl, Thomas","first_name":"Thomas"},{"full_name":"Kengyel, Daniela","first_name":"Daniela","last_name":"Kengyel"},{"last_name":"Zahadat","first_name":"Payam","full_name":"Zahadat, Payam"},{"first_name":"Gerald","full_name":"Radspieler, Gerald","last_name":"Radspieler"},{"last_name":"Wotawa","first_name":"Franz","full_name":"Wotawa, Franz"}],"publication":"Principles and Practice of Multi-Agent Systems (PRIMA 2015)","department":[{"_id":"63"},{"_id":"238"}],"user_id":"15415","title":"Potential of Heterogeneity in Collective Behaviors: A Case Study on Heterogeneous Swarms","language":[{"iso":"eng"}],"citation":{"bibtex":"@inproceedings{Hamann_Schmickl_Kengyel_Zahadat_Radspieler_Wotawa_2015, title={Potential of Heterogeneity in Collective Behaviors: A Case Study on Heterogeneous Swarms}, booktitle={Principles and Practice of Multi-Agent Systems (PRIMA 2015)}, author={Hamann, Heiko and Schmickl, Thomas and Kengyel, Daniela and Zahadat, Payam and Radspieler, Gerald and Wotawa, Franz}, year={2015}, pages={201–217} }","mla":"Hamann, Heiko, et al. “Potential of Heterogeneity in Collective Behaviors: A Case Study on Heterogeneous Swarms.” Principles and Practice of Multi-Agent Systems (PRIMA 2015), 2015, pp. 201–17.","chicago":"Hamann, Heiko, Thomas Schmickl, Daniela Kengyel, Payam Zahadat, Gerald Radspieler, and Franz Wotawa. “Potential of Heterogeneity in Collective Behaviors: A Case Study on Heterogeneous Swarms.” In Principles and Practice of Multi-Agent Systems (PRIMA 2015), 201–17, 2015.","apa":"Hamann, H., Schmickl, T., Kengyel, D., Zahadat, P., Radspieler, G., & Wotawa, F. (2015). Potential of Heterogeneity in Collective Behaviors: A Case Study on Heterogeneous Swarms. In Principles and Practice of Multi-Agent Systems (PRIMA 2015) (pp. 201–217).","ama":"Hamann H, Schmickl T, Kengyel D, Zahadat P, Radspieler G, Wotawa F. Potential of Heterogeneity in Collective Behaviors: A Case Study on Heterogeneous Swarms. In: Principles and Practice of Multi-Agent Systems (PRIMA 2015). ; 2015:201-217.","ieee":"H. Hamann, T. Schmickl, D. Kengyel, P. Zahadat, G. Radspieler, and F. Wotawa, “Potential of Heterogeneity in Collective Behaviors: A Case Study on Heterogeneous Swarms,” in Principles and Practice of Multi-Agent Systems (PRIMA 2015), 2015, pp. 201–217.","short":"H. Hamann, T. Schmickl, D. Kengyel, P. Zahadat, G. Radspieler, F. Wotawa, in: Principles and Practice of Multi-Agent Systems (PRIMA 2015), 2015, pp. 201–217."},"type":"conference","year":"2015","page":"201-217","date_updated":"2022-01-06T06:54:17Z","_id":"19991"},{"_id":"19992","date_updated":"2022-01-06T06:54:17Z","doi":"10.1007/s11721-015-0108-8","language":[{"iso":"eng"}],"year":"2015","citation":{"mla":"Valentini, Gabriele, and Heiko Hamann. “Time-Variant Feedback Processes in Collective Decision-Making Systems: Influence and Effect of Dynamic Neighborhood Sizes.” Swarm Intelligence, 2015, pp. 153–76, doi:10.1007/s11721-015-0108-8.","bibtex":"@article{Valentini_Hamann_2015, title={Time-variant feedback processes in collective decision-making systems: influence and effect of dynamic neighborhood sizes}, DOI={10.1007/s11721-015-0108-8}, journal={Swarm Intelligence}, author={Valentini, Gabriele and Hamann, Heiko}, year={2015}, pages={153–176} }","apa":"Valentini, G., & Hamann, H. (2015). Time-variant feedback processes in collective decision-making systems: influence and effect of dynamic neighborhood sizes. Swarm Intelligence, 153–176. https://doi.org/10.1007/s11721-015-0108-8","ama":"Valentini G, Hamann H. Time-variant feedback processes in collective decision-making systems: influence and effect of dynamic neighborhood sizes. Swarm Intelligence. 2015:153-176. doi:10.1007/s11721-015-0108-8","chicago":"Valentini, Gabriele, and Heiko Hamann. “Time-Variant Feedback Processes in Collective Decision-Making Systems: Influence and Effect of Dynamic Neighborhood Sizes.” Swarm Intelligence, 2015, 153–76. https://doi.org/10.1007/s11721-015-0108-8.","ieee":"G. Valentini and H. Hamann, “Time-variant feedback processes in collective decision-making systems: influence and effect of dynamic neighborhood sizes,” Swarm Intelligence, pp. 153–176, 2015.","short":"G. Valentini, H. Hamann, Swarm Intelligence (2015) 153–176."},"type":"journal_article","page":"153-176","user_id":"15415","title":"Time-variant feedback processes in collective decision-making systems: influence and effect of dynamic neighborhood sizes","author":[{"last_name":"Valentini","full_name":"Valentini, Gabriele","first_name":"Gabriele"},{"full_name":"Hamann, Heiko","first_name":"Heiko","last_name":"Hamann"}],"department":[{"_id":"63"},{"_id":"238"}],"publication":"Swarm Intelligence","status":"public","date_created":"2020-10-13T09:27:48Z","publication_status":"published","publication_identifier":{"issn":["1935-3812","1935-3820"]}}]