An interesting tidbit quote on the optimal assignment problem (aka ST–SR–IA:Single-Task Robots, Single-RobotTasks, Instantaneous Assignment, the multirobot task allocation problem): “Thus, for small-scale to medium-scale systems, say n< 200, a broadcast-based centralized assignment solution is likely the better choice” [1]. Note that n is the number of robots. This is an interesting assertion and is… Continue reading ST-SR-IA number of robots
Analogy
I gotta use this one day: The task is not easy, as policy makers and political and economic elites often reinforce dysfunctional institutions. But it is impossible without considering the varieties of capitalism in play today. The right institutional makeup can in fact increase equitable wealth creation, but to ignore institutional differences is akin to putting an… Continue reading Analogy
Secure Task Allocation Scheme
In the future the robots that are being used will most likely be common enough that anyone could purchase one and given enough knowledge infiltrate a system of robots. Currently the level of security in task allocation methods for robots is like that of communication of localization data between large ships, nonexistent. Methods for attack:… Continue reading Secure Task Allocation Scheme
Fuzzy Teams (3/3/14)
I wrote this on a forum for a class I had. I was thinking about framing team membership with fuzzy sets. 1. Need a good way to keep up-to-date on how likely each of the other agents are part of your team 2. How to tell how others perceive you being in particular teams. The… Continue reading Fuzzy Teams (3/3/14)
more ideas
So the idea is that we have these beacons. They have a broadcast radius. In that radius they state what they want to have done to them, ie moved to location (x,y). Then as robots explore the environment they discover tasks. they can decide to take on the task or remember it and then continue… Continue reading more ideas
Google glass idea
I sitting at a counter watching the cook make the orders. For each item he would have to look back at the slip of paper with what to make next. This seems like the perfect situation to have google glass. The orders would appear on the google glass in an optimized order and allow the… Continue reading Google glass idea
Dynamic lane reversal and Braess’ Paradox
http://www.cs.utexas.edu/~pstone/Papers/bib2html-links/ITSC11-hausknecht.pdf Dynamic Lane Reversal in Traffic Management Peter Stone et al. This paper is very interesting. Based on my recent learning about the Price of Anarchy and Braess’ paradox I wonder why their method works. Certainly it is an immediate solution. However, I would imagine that as people learn the system it would degrade and… Continue reading Dynamic lane reversal and Braess’ Paradox
Adaptive Mechanism Design
I found a Peter Stone paper that address part of my idea on adaptive auctions and mechanism design. However, they only took it part of the way. They only looked at adapting the parameters of single type of auction. Rather my idea was that not only would that happen but also the type of auction… Continue reading Adaptive Mechanism Design
Future generations
One day kids won’t be able to say to there parents “Can I stay up until I finish this page” ebooks don’t have pages. Just read xkcd and saw http://xkcd.com/1411/.
Reply with BCCs
I think you should be able to have BCC’s that when the person the email was TO: replies will also unknowingly be replying to the rest. This could be accomplished if the person replies to the original sender. The original sender will receive the mail and that person’s account knows that they BCC’ed others as… Continue reading Reply with BCCs