I’m happy to announce the arrival of a new colleague: Dr. Jannik Laval.
Officially, Jannik started working for our team since Friday 2nd november 2012. That was a Pharo sprint day hosted by our partner the RMoD INRIA Lille team. This was the opportunity to revive our dormant project: OCEAN. Luc Fabresse, Jannik Laval and my self are the main contributors of this new network library for Pharo. We worked a on it while Jannik was doing his PhD. An now that he is back, we have new energy to get this project done.
However, the main effort that we all concetrate on is Robotics. With the rest of the CAR team, we target models, software infrastructures and tools to ease the development of control architectures for robots. We expect to produce soon some cool demos.
As a response to a question in the Pharo-dev mailing list, Esteban Lorenzano explains how to make an iOS app that makes use of Pharo. There should be soon a web page on the Pharo web site that summarizes this and provides other details. In the meanwhile, I would like to share with you this solution. Note that Esteban also announced that in a couple of weeks there will be a jenkins job to build iOS VMs.
Assuming that you already has in your system:
1) Xcode (I’m using version 4.4)
2) CMake (I’m using version 2.8.8)
And assuming also that you already has an iOS development user.
For use pharo in your iPad you need to follow the following steps:
1) clone https://git.gitorious.org/~estebanlm/cogvm/cog-osx.git
2) in ./image dir prepare a VMMaker image (using pharo 1.4):
Dr. Luc Fabresse, Ecole des Mines de Douai, Université de Lille Nord de France (co-supervisor)
Dr. Noury Bouraqadi, Ecole des Mines de Douai, Université de Lille Nord de France (co-supervisor)
You’ll find below a summary of the thesis:
Application-Level Virtual Memory for Object-Oriented Systems
During the execution of object-oriented applications, several millions of objects are created, used and then collected if they are not referenced. Problems appear when objects are unused but cannot be garbage-collected because they are still referenced from other objects. This is an issue because those objects waste primary memory and applications use more primary memory than what they actually need. We claim that relying on operating systems (OS) virtual memory is not always enough since it is completely transparent to applications. The OS cannot take into account the domain and structure of applications. At the same time, applications have no easy way to control nor influence memory management.
In this dissertation, we present Marea, an efficient application-level virtual memory for object-oriented programming languages. Its main goal is to offer the programmer a novel solution to handle application-level memory. Developers can instruct our system to release primary memory by swapping out unused yet referenced objects to secondary memory.
Marea is designed to: 1) save as much memory as possible i.e., the memory used by its infrastructure is minimal compared to the amount of memory released by swapping out unused objects, 2) minimize the runtime overhead i.e., the swapping process is fast enough to avoid slowing down primary computations of applications, and 3) allow the programmer to control or influence the objects to swap.
Besides describing the model and the algorithms behind Marea, we also present our implementation in the Pharo programming language. Our approach has been qualitatively and quantitatively validated. Our experiments and benchmarks on real-world applications show that Marea can reduce the memory footprint between 25% and 40%
Santiago Bragagnolo joined the team since the beginning of the month, as we announced during our talk on Smalltalk for robotics last ESUG conference (see slides below). Santiago is working full time on the RoboShop project where we aim at building an infrastructure for service robotics in the context of a shopping mall. We are using ROS (Robot Operating System) as a middleware. Currently, we are focusing on RoSt a framework to bridge Pharo Smalltalk with ROS. The end of the tunnel is becoming closer. We can call services provided by ROS nodes and we can send ROS topic messages. We are currently making tests with the ROS turtle simulator. We hopefully will soon start experimenting with our human size robots.
As a recreation for Christmas holidays, I hacked Bot Grid Simulator to render a winter landscape. It is still a robot simulation, since snow flakes are robots with a simple behavior. There about 500 of them. Hope you’ll enjoy the video. Merry Christmas and happy new year 2012.
Two weeks ago, I thought that it’s more than time to revive the work started by my former PhD student Van Tuan Le. His algorithms for on multi-robot cooperation were validated using Bot Grid Simulator (BGS). I posted a while ago a simulation that illustrates our ICTAI2009 paper (Distributed constraint reasoning applied to multi-robot exploration) that relies on the connectivity awareness as introduced in our ICRA2009 paper (Making networked robot connectivity-aware). However, the simulator was just a prototype and the code was mixed with other unrelated stuff. My goal is to make it clean enough so it can be reused by other people. I started a dedicated repo on SqueakSource with the latest version (number 13) of BGS as left by Serge Stinckwhich (co-supervisor of Tuan’s PhD) in fall 2009. Then, I started cutting off parts, refactoring others, and writing tests. Progress at the beginning was slow, but things keep getting better. By the 13th of november 2011, I had a first relatively clean and tested version (number 29) of the kernel. I made a youtube video to celebrate it. One week later, I improved the design and the GUI (version 37). Now, each robot has a heading and a range sensor that are represented graphically as shown on the new video. More to come soon hopefully :-)
I was invited to give a talk at the JM2L free software days (Journées Méditérrannéennes du Logiciel Libre) in Nice (French Riviera). My presentation (in french) that took place saturday the 27th of november was about Robotics & Pharo are availble below.